AVL Tree Practice

In order for an AVL Tree to be considered balance, every node must have a balance factor of -1, 0, or 1.

• True

• False

What is the time complexity to rebalance an AVL Tree?

• O(1)

• O(log(n)

• close to O(log(n))

• O(n)

• O(n * log(n))

What would be the time complexity to search for a value in this AVL tree. (Hint look at the balance factors)

• O(1)

• O(log(n))

• close to O(log(n))

• O(n)

• O(n * log(n))

What type of Rotation would we need to perform on this AVL Tree?

• Single Right

• Single Left

• Double Right

• Double Left

• The tree is balanced and does not need to be rotated.

What type of Rotation would we need to perform on this AVL Tree?

• Single Right

• Single Left

• Double Right

• Double Left

• The tree is balanced and does not need to be rotated.

What type of Rotation would we need to perform on this AVL Tree?

• Single Right

• Single Left

• Double Right

• Double Left

• The tree is balanced and does not need to be rotated.

What type of Rotation would we need to perform on this AVL Tree?

• Single Right

• Single Left

• Double Right

• Double Left

• The tree is balanced and does not need to be rotated.

What type of Rotation would we need to perform on this AVL Tree?

• Single Right

• Single Left

• Double Right

• Double Left

• The tree is balanced and does not need to be rotated.

What type of Rotation would we need to perform on this AVL Tree?

• Single Right

• Single Left

• Double Right

• Double Left

• The tree is balanced and does not need to be rotated.

What is the balance factor of the root node?