Binary Search Trees(B Tree) MCQ question and answer with solution | Data Structure MCQs

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

A. To maintain O(log n) time complexity for insertions, deletions, and searches.

B. To ensure the tree is always a complete binary tree.

C. To allow nodes to be stored in any order.

D. To minimize memory usage.

A. Reverse Inorder

B. Preorder

C. Postorder

D. Level-order

A. Replace it with its inorder successor or predecessor, then remove the successor or predecessor.

B. Directly remove the node and replace it with its left child.

C. Directly remove the node and replace it with its right child.

D. Replace it with its left child.

A. To maintain balance and keep the tree balanced.

B. To move a node to the right subtree.

C. To convert a BST into a binary heap.

D. To find the maximum value node.

A. All nodes in the left subtree are smaller than the node itself.

B. All nodes in the left subtree are larger than the node itself.

C. The left subtree contains nodes with equal values.

D. The left subtree is always empty.

A. 2^{h - 1}

B. 2^(h+1) - 1

C. 2^(h)

D. 2^h

A. By traversing to the rightmost node from the root.

B. By traversing to the leftmost node from the root.

C. By finding the root node.

D. By searching the entire tree.

A. Search, insertion, and deletion operations may degrade to O(n) time complexity.

B. The tree automatically rebalances itself.

C. The tree converts into a binary heap.

D. The tree becomes a complete binary tree.

A. All levels are fully filled, and all leaves are at the same level.

B. The height of the tree is minimal.

C. The tree contains only leaf nodes.

D. All nodes have exactly two children.