The worst case running time to search for an element in a balanced in a binary search tree with n2^n elements is

(A)

(B)

(C)

(D)

(A)

(B)

(C)

(D)

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.

What is the worst case possible height of AVL tree?

Which of the following is AVL Tree?

A100 / \ 50 200 / \ 10 300B100 / \ 50 200 / / \ 10 150 300 / 5C100 / \ 50 200 / \ / \ 10 60 150 300 / \ \ 5 180 400

Consider the following AVL tree.

60 / \ 20 100 / \ 80 120Which of the following is updated AVL tree after insertion of 70

A70 / \ 60 100 / / \ 20 80 120B100 / \ 60 120 / \ / 20 70 80C80 / \ 60 100 / \ \ 20 70 120D80 / \ 60 100 / / \ 20 70 120

Which of the following is a self-adjusting or self-balancing Binary Search Tree

Consider the following left-rotate and right-rotate functions commonly used in self-adjusting BSTs

T1, T2 and T3 are subtrees of the tree rooted with y (on left side) or x (on right side) y x / \ Right Rotation / \ x T3 – - – - – - – > T1 y / \ < - - - - - - - / \ T1 T2 Left Rotation T2 T3Which of the following is tightest upper bound for left-rotate and right-rotate operations.

Which of the following is true

Which of the following is true about Red Black Trees?

Which of the following is true about AVL and Red Black Trees?