Advanced Trees (AVL, RedBlack, BTrees) MCQ question and answer with solution | Data Structure MCQs

A. Easier to implement.

B. Faster insertion and deletion.

C. Better worst-case time complexity for balancing.

D. Smaller memory footprint.

A. It is an internal node.

B. It needs to be rotated.

C. It is balanced and requires no changes.

D. It is a leaf node.

A. Keys are stored in random order.

B. Keys are stored in reverse order.

C. Keys are stored based on access frequency.

D. Keys are stored in sorted order.

A. They guarantee balanced height but not exact height.

B. They guarantee exact height balancing.

C. They do not support deletion.

D. They are balanced using a different method.

A. 3

B. 80

C. 27

D. 26

A. True

B. False

A. AVL tree

B. B-tree

C. B+ -tree

D. Splay tree

A. O (log n!)

B. Ɵ (n!)

C. O (n²)

D. Ɵ (n + x)

A. O (log M)

B. O (M!)

C. Exponential to Length of Tree

D. Linear to Length of Tree

A. The tree has n leaves.

B. The tree has n roots

C. Height of Tree is n

D. Depth of tree is n