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

A. O(n)

B. O(log² n)

C. O(log n)

D. O(1)

A. m + 1

B. m

C. m / 2

D. m + 1

A. It can have fewer than the minimum number of children.

B. It must have exactly m children.

C. It must be a leaf.

D. It cannot have more than m children.

A. 1

B. 4

C. 2

D. 3

A. The height is larger.

B. The height is the same.

C. The height is smaller.

D. The height is unpredictable.

A. Deletion

B. Both insertion and deletion

C. Tree rotation

D. Deletion

A. O(1)

B. O(log² n)

C. O(log n)

D. O(n)

A. The node is immediately reinserted.

B. The tree is rebuilt from scratch.

C. The imbalance is ignored.

D. Rebalancing with rotations is performed.

A. Moving a node to the root to improve access times.

B. Rotating nodes to maintain balance.

C. Re-coloring nodes to restore properties.

D. Inserting nodes while maintaining balance.

A. Rebalancing when the height changes.

B. Search when a key is found.

C. Deletion when a node is empty.

D. Insertion when a node is full.