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

A. The height difference between the left and right subtrees is at most 1

B. The left subtree is always smaller than the right subtree

C. The right subtree is always smaller than the left subtree

D. All levels of the tree are completely filled

A. Full Binary Tree

B. Complete Binary Tree

C. Perfect Binary Tree

D. Binary Search Tree

A. AVL trees maintain balance, ensuring O(log n) operations

B. AVL trees allow faster search operations

C. AVL trees require less space

D. AVL trees are easier to implement

A. Every node is either red or black

B. The root is always black

C. Every path from a node to its descendant leaves has the same number of black nodes

D. Every node has at most two children

A. Preorder

B. Inorder

C. Postorder

D. Level-order

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

A. Preorder

B. Inorder

C. Postorder

D. Level-order

A. Inorder

B. Preorder

C. Postorder

D. Level-order

A. A complete binary tree is filled completely at all levels except possibly the last, while a full binary tree has all nodes with either 0 or 2 children.

B. A full binary tree is filled completely at all levels except possibly the last, while a complete binary tree has all nodes with either 0 or 2 children.

C. A complete binary tree has only one level, while a full binary tree has multiple levels.

D. There is no difference.

A. AVL Tree

B. Red-Black Tree

C. B-Tree

D. Splay Tree