Data Structures MCQs with Answers
Practice important Data Structures MCQs with answers and explanations.
Multiple Choice Questions
Q261: Which method is used to print nodes of a binary search tree in sorted order?
- A: Preorder
- B: Postorder
- C: Inorder
- D: Level-order
View Answer
C
Q262: How does the insert function handle duplicate strings in a binary search tree?
- A: It replaces the existing node with the new node
- B: It increments a counter for duplicates
- C: It displays a message and deletes the new node
- D: It skips the insertion of the duplicate string
View Answer
C
Q263: When deleting a node with two children from a BST, what is the next step after finding the in-order successor?
- A: Replace the node with the in-order successor and delete the successor node
- B: Delete the node and its left child
- C: Replace the node with the in-order predecessor and delete the predecessor node
- D: Simply delete the node without further actions
View Answer
A
Q264: What is the first step when deleting a leaf node from a BST?
- A: Replace it with its right child
- B: Remove it from the tree
- C: Replace it with its left child
- D: Adjust its parent's pointer to NULL
View Answer
B
Q265: In the wordTree function, what is the role of the inorder function?
- A: To insert new nodes into the BST
- B: To delete nodes from the BST
- C: To print the nodes of the BST in sorted order
- D: To check for duplicate nodes
View Answer
C
Q266: In a binary search tree, what does an in-order traversal produce?
- A: Nodes sorted in descending order
- B: Nodes sorted in random order
- C: Nodes sorted in ascending order
- D: Nodes sorted by level
View Answer
C
Q267: Which of the following statements is true about the delete method for a node with one child?
- A: The node is deleted and its child becomes the new child of the node’s parent
- B: The node is deleted and the parent is updated to point to NULL
- C: The node’s child is promoted to its parent’s position
- D: The node’s parent is deleted and its child takes its place
View Answer
A
Q268: How does the insert method determine whether to traverse left or right in a BST with strings?
- A: By comparing ASCII values of the first character of each string
- B: By comparing the lengths of the strings
- C: By using the strcmp() function to compare the entire strings
- D: By checking the length of the longest string
View Answer
C
Q269: What is the output of the inorder traversal of a binary search tree?
- A: Nodes in the order they were inserted
- B: Nodes in level order
- C: Nodes sorted in ascending order
- D: Nodes sorted in descending order
View Answer
C
Q270: In the delete method, what is the role of the in-order successor when deleting a node with two children?
- A: To replace the node to be deleted and then delete the successor node
- B: To replace the node to be deleted with its left child
- C: To replace the node to be deleted with its right child
- D: To adjust the parent node’s pointer to the successor node
View Answer
A