Trees in Data Structures MCQ question and answer with solution | Data Structure MCQs

A. They are a type of self-balancing binary search tree.

B. They allow duplicate keys.

C. They do not require balancing.

D. They only support insertion operations.

A. The node that comes immediately after a given node in an inorder traversal.

B. The node that comes immediately before a given node in an inorder traversal.

C. The node with the maximum value in the left subtree.

D. The node with the minimum value in the right subtree.

A. Inorder, Preorder, or Postorder

B. Level-order

C. Breadth-first search

D. Randomized order

A. It performs rotations to move accessed elements closer to the root.

B. It maintains balance by performing rotations.

C. It allows elements to be stored in a balanced order.

D. It ensures the height is minimized by reordering elements.

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

A. By checking if each node's left children are smaller and right children are larger.

B. By ensuring the tree is balanced.

C. By verifying that all nodes have two children.

D. By checking the height of the tree.

A. It guarantees O(log n) time complexity for insertion, deletion, and search operations.

B. It uses less memory compared to a regular BST.

C. It allows duplicate keys to be stored.

D. It automatically sorts elements.

A. Inorder

B. Preorder

C. Postorder

D. Level-order

A. All levels are completely filled except possibly the last level, which is filled from left to right.

B. All nodes have exactly two children.

C. The tree is perfectly balanced.

D. All nodes have only one child.

A. log2(n)

B. log2(n) - 1

C. 2*log2(n)

D. log2(n) + 1