AVL Tree

A height balanced binary search tree is called__________

• height tree

• AVL tree

• binary tree

• binary search tree

The balancing factor for AVL tree =

• hL-hR

• hR-hL

• hL-hL

• hR-hR

The allowed values for height of an avl tree

• 0,1

• 2,0,-2

• 0,1,2

• -1,0,1

For RL imbalance which rotation is need to balance the tree

• Single LL rotation

• Single RR rotation

• LL and RR rotation

• None

Possible Operations on AVL tree

• insertion

• deletion

• traversal

• all the above

Which of the following is a double rotation

• LL rotation

• RR rotation

• RL rotation

• None

What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.

• 2

• 3

• 4

• 5

In an AVL tree the difference between heights of left and right sub trees cannot be more than

• 1

• 2

• 3

• 0

AVL tree got its name after its

• Adelson-Velsky and Landis

• Adam Velsky Lenin

• Adelson Vel Landis

• None

The sequence of insertion 10,12,14 will lead to imbalance by using which rotation can be used to balance the tree

• RR rotation

• LL rotation

• LR rotation

• RL rotation