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. Inorder

B. Preorder

C. Postorder

D. Level-order

A. 1

B. 2

C. 3

D. Any number

A. Verify if all nodes in the left subtree are less than the root and all nodes in the right subtree are greater than the root.

B. Check if the tree is balanced.

C. Ensure all nodes have exactly two children.

D. Verify the height of the tree.

A. Insertion

B. Deletion

C. Search

D. All of the above

A. The node is replaced by its predecessor or successor, and then the predecessor or successor is removed.

B. The node is simply removed.

C. The node's right child replaces it.

D. The node is moved to the root.

A. To maintain balance and ensure logarithmic height in self-balancing trees.

B. To optimize search operations.

C. To sort elements in the tree.

D. To update node values.

A. Root

B. Leaf

C. Parent

D. Internal node

A. It has a value greater than all values in its left subtree and less than all values in its right subtree.

B. It is the root of the tree.

C. It has at least one child.

D. It is the only node in the tree.

A. Traverse to the leftmost node from the root.

B. Traverse to the rightmost node from the root.

C. Find the node with the maximum value.

D. Find the node with the second highest value.