Data Structures MCQs with Answers
Practice important Data Structures MCQs with answers and explanations.
Multiple Choice Questions
Q231: What type of traversal prints nodes as: left subtree, right subtree, root?
- A: Preorder
- B: Inorder
- C: Postorder
- D: Level-order
View Answer
C
Q232: Which C++ function call prints the node value before traversing its left and right subtrees?
- A: preorder
- B: inorder
- C: postorder
- D: levelorder
View Answer
A
Q233: In a complete binary tree with 100,000 nodes, what is the approximate depth?
- A: 10
- B: 15
- C: 20
- D: 25
View Answer
C
Q234: How does recursion work in the preorder traversal method?
- A: Calls itself on the left subtree before printing the node value
- B: Calls itself on the right subtree before printing the node value
- C: Prints the node value before calling itself on the left and right subtrees
- D: Calls itself on the left subtree and then the right subtree, printing after returning
View Answer
C
Q235: What does the postorder traversal method do?
- A: Prints the root, then left subtree, then right subtree
- B: Prints the left subtree, then right subtree, then root
- C: Prints the right subtree, then left subtree, then root
- D: Prints the root, then right subtree, then left subtree
View Answer
B
Q236: What is the result of the following preorder function execution?
- A: It prints nodes in postorder
- B: It prints nodes in the order of insertion
- C: It prints nodes in preorder
- D: It prints nodes in inorder
View Answer
C
Q237: What is the primary benefit of using a complete binary tree compared to a linked list in terms of search efficiency?
- A: Faster search times due to fewer comparisons
- B: More memory-efficient
- C: Easier to implement
- D: Better for sorting
View Answer
A
Q238: How does the find method differ from the insert method in a binary search tree?
- A: find checks for duplicates before insertion
- B: find only searches for a number while insert adds a number
- C: find prints the tree structure
- D: find traverses in reverse order
View Answer
B
Q239: What is the depth of a binary tree with 1,000,000 nodes?
- A: Approximately 10
- B: Approximately 15
- C: Approximately 20
- D: Approximately 30
View Answer
D
Q240: In the inorder traversal, which subtree is processed first?
- A: Right subtree
- B: Left subtree
- C: Root
- D: Both subtrees simultaneously
View Answer
B