Question

A. All AVL trees are binary search trees, but not vice-versa
B. There are four types of rotations to balance the AVL trees.
C. Four types of traversals are possible on tree data structure
D. The smallest elements in binary search is the right most element.
E. The time complexity of binary sort algorithm is O (logn)
choose the correct answer from the options given below:

• A. A,B,C,D and E only
• B. A,B,C only
• C. B,C,D only
• D. B,C,D and E only

Answer 1

Answer: (B)

A,B,C only

Answer 2

The correct option is(B): A,B,C only