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

A. AVL trees are faster for insertion.

B. Red-Black trees have a simpler implementation.

C. AVL trees use less memory.

D. Red-Black trees require fewer rotations.

A. O(1)

B. O(log² n)

C. O(log n)

D. O(n)

A. ⌊m / 2⌋

B. m - 1

C. ⌈m / 2⌉ - 1

D. ⌈m / 2⌉

A. Rotations

B. Redistribution

C. Splitting

D. Merging

A. A method to sort elements in a tree.

B. A technique for hashing elements.

C. A method of balancing AVL trees.

D. A technique to move recently accessed nodes to the root.

A. Red property

B. Balance property

C. Black-height property

D. Node-coloring property

A. B-Trees have no constraints on height.

B. B-Trees allow multiple children per node.

C. BSTs can store more keys per node.

D. B-Trees have no constraints on height.

A. Black

B. Can be either red or black

C. It varies based on the position

D. Red

A. To maintain sorted data with efficient insertion and deletion operations.

B. To perform quick sorting operations.

C. To minimize data retrieval time.

D. To provide efficient key hashing.

A. When a node's height is greater than its parent.

B. When a node's balance factor is -3 or +3.

C. When a node's balance factor is -1 or +1.

D. When a node's balance factor is -2 or +2.