CS301P Quiz 5 Set 2

VU TOOLKIT · CS301P - Quiz No.5 · Date: 11 May 2026

Q1. Recursion is performed with the help of ___________ data structure.

1. Queue
2. Stack
3. Binary Tree
4. Linked List

Correct answer: Stack

Q2. How many comparison(s) will be made at each level of a BST for searching a number which is not present in BST?

1. 1
2. 2
3. 4
4. 3

Correct answer: 1

Q3. In which traversal method left subtree is visited in first step?

1. Not possible to traverse left subtree
2. level-order traversal
3. Preorder traversal
4. In-order traversal

Correct answer: Preorder traversal

Q4. Which of the following is the in-order traversal of the given tree?

1. (L, N, R)
2. (N, L, R)
3. (R, L, N)
4. (L, R, N)

Correct answer: (L, N, R)

Q5. What does the following traversal code do? void func (TreeNode* treeNode) { if( treeNode != NULL ) { func(treeNode->getLeft()); func(treeNode->getRight()); cout << *(treeNode->getInfo())<<" "; } }

1. In-order traversal
2. Preorder traversal
3. Level-order traversal
4. Post-order traversal

Correct answer: Post-order traversal