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

A. Root

B. Leaf

C. Child

D. Sibling

A. Each node in a binary tree has at most two children, whereas in a general tree, nodes can have more than two children.

B. Binary trees are balanced, while general trees are not.

C. Binary trees only have one level, while general trees have multiple levels.

D. Binary trees have a fixed height, while general trees have a variable height.

A. Postorder

B. Inorder

C. Preorder

D. Level-order

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

A. By performing rotations to move accessed nodes to the root

B. By balancing the tree after each operation

C. By using a self-balancing mechanism

D. By storing elements in a sorted manner

A. It determines the maximum number of children each node can have

B. It determines the minimum height of the tree

C. It determines the number of levels in the tree

D. It determines the maximum number of levels

A. Storing a dictionary for fast prefix-based searches

B. Performing binary search operations

C. Implementing balanced search trees

D. Storing hierarchical data

A. It ensures the tree remains balanced

B. It ensures nodes are always red

C. It ensures the tree is full

D. It ensures the tree is complete

A. 2^L

B. 2^(L+1)

C. 2^(L-1)

D. 2^(L+2)

A. A binary heap maintains a heap property and is typically used to implement priority queues, while a binary search tree maintains sorted order of elements.

B. A binary heap is a type of balanced tree, while a binary search tree is an unbalanced tree.

C. A binary heap stores elements in sorted order, while a binary search tree does not.

D. A binary heap supports fast insertion and deletion, while a binary search tree supports fast search.