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

A. Root

B. Maximum node

C. Minimum node

D. Leaf

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

A. The smallest node in the right subtree.

B. The largest node in the left subtree.

C. The largest node in the right subtree.

D. The smallest node in the left subtree.

A. The left subtree contains nodes with values less than the root, and the right subtree contains nodes with values greater than the root.

B. The left subtree contains nodes with values greater than the root, and the right subtree contains nodes with values less than the root.

C. Both subtrees have equal values.

D. The left subtree is always empty.

A. When the data is not sorted.

B. When frequent insertions and deletions are needed.

C. When the tree must be balanced at all times.

D. When elements need to be stored in a priority order.

A. To balance the tree and maintain its properties.

B. To find the minimum value node.

C. To delete a node with two children.

D. To perform a level-order traversal.

A. Nodes are visited in ascending order.

B. Nodes are visited in descending order.

C. Nodes are visited in a random order.

D. Nodes are visited in the order they were inserted.

A. The height of the tree is minimized.

B. All nodes have exactly two children.

C. All levels are completely filled except possibly the last.

D. The left and right subtrees have equal number of nodes.

A. The largest node in the left subtree.

B. The smallest node in the right subtree.

C. The smallest node in the left subtree.

D. The largest node in the right subtree.

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)