PERFORM SINGLE LEFT

IN SERT $15$: rotailon AT Node $20$:Task Details

Your task is to answer all the following questions and complement each answer with a detailed explanation.

Draw a series of figures demonstrating the insertion of the values.

$20,9,3,7,5,8,25,30,15,6,17$

into an initially empty AVL tree. Insert the values in the order they appear in the given sequence. You

must

Show the resulting AVL tree immediately before and after each insertion step that causes the

tree's rebalancing.

Calculate the balance degree $($as the difference between the heights of the left and the right

subtrees rooted at a node$)$ and label each node of the AVL tree before and after the necessary

rebalancing.

Clearly indicate the node$($s$)$ at which rotation is performed. Here, let $v$ be the first node you

encounter in going up from the newly added node, say $z,$ toward the root of the AVL tree $T$ such

that $v$ is unbalanced. And let $x$ denote the child of $v$ with greater height $($and note that $x$ must

be an ancestor of $z).$ Determine whether the subtree of $T$ rooted at $v$ is right or left heavy.

Similarly, specify whether the subtree of $T$ rooted at $x$ is right or left heavy.

Performing a single or a double rotation as the rebalancing $($repairing$)$ operation on the AVL tree,

specify the type of the rotation that you apply: Single Left Rotation, Single Right Rotation, Left$-$

Right Rotation, or Right$-$Left Rotation.

Each time a new value has been inserted, ensure that both the Binary Search Tree Property and

the Height$-$Balance $($AVL Tree$)$ Property are maintained.

THe photos Task Details

Your task is to answer all the following questions and complement each answer with a detailed explanation.

Draw a series of figures demonstrating the insertion of the values.

$20,9,3,7,5,8,25,30,15,6,17$

into an initially empty AVL tree. Insert the values in the order they appear in the given sequence. You

must

Show the resulting AVL tree immediately before and after each insertion step that causes the

tree's rebalancing.

Calculate the balance degree $($as the difference between the heights of the left and the right

subtrees rooted at a node$)$ and label each node of the AVL tree before and after the necessary

rebalancing.

Clearly indicate the node$($s$)$ at which rotation is performed. Here, let $v$ be the first node you

encounter in going up from the newly added node, say $z,$ toward the root of the AVL tree $T$ such

that $v$ is unbalanced. And let $x$ denote the child of $v$ with greater height $($and note that $x$ must

be an ancestor of $z).$ Determine whether the subtree of $T$ rooted at $v$ is right or left heavy.

Similarly, specify whether the subtree of $T$ rooted at $x$ is right or left heavy.

Performing a single or a double rotation as the rebalancing $($repairing$)$ operation on the AVL tree,

specify the type of the rotation that you apply: Single Left Rotation, Single Right Rotation, Left$-$

Right Rotation, or Right$-$Left Rotation.

Each time a new value has been inserted, ensure that both the Binary Search Tree Property and

the Height$-$Balance $($AVL Tree$)$ Property are maintained. is me starting the question but I think it's wrong. Please correct it by physically drawing the tree with written explanation of each step