CS301 Quiz 2 May 2026

Quiz 1 - CS301 (Q1/10)

Question:

In Preorder traversal of a binary tree the second step is ____________

A. traverse the left subtree

B. traverse the right subtree C. traverse the leaf node D. traverse the root Copied: 5/12/2026, 12:10:05 PM

Quiz 2 - CS301 (Q2/10)

Question:

Level-order traversal for Binary Search Tree can be implemented, _______________.

A. Through max-heap

B. Only through non-recursive method

C. Through both recursive method call and non-recursive method call D. Only through recursive method Copied: 5/12/2026, 12:10:37 PM

Quiz 3 - CS301 (Q3/10)

Question:

Level of any node is ________ than/to the level of its parent node.

A. One more

B. two more

C. Equal D. One less Copied: 5/12/2026, 12:11:15 PM

Quiz 4 - CS301 (Q4/10)

Question:

If p is pointing to a node in an existing tree then info(p) means:

A. Returns the pointer of node p

B. Returns the contents of node p

C. Returns false if it is not a parent node D. Returns true if it is a parent node Copied: 5/12/2026, 12:11:32 PM

Quiz 5 - CS301 (Q5/10)

Question:

In which traversal method, the recursive calls can be used to traverse a binary tree ?

1. In postorder and preorder traversal only
2. In postorder and inorder traversal only
3. In preorder and inorder traversal only
4. In preorder, postorder and inorder traversal only

Correct answer: In preorder, postorder and inorder traversal only

Copied: 5/12/2026, 12:11:54 PM

Quiz 6 - CS301 (Q6/10)

Question:

In time-based simulation, we maintain a/an __________

A. variable B. register C. clock

D. event

Copied: 5/12/2026, 12:12:20 PM

Quiz 7 - CS301 (Q7/10)

Question:

Which of the following is TRUE for search operations in a binary tree as compared to linked list or an array?

1. It reduces the number of comparisons
2. It increases the number of comparisons
3. The number of comparisons remain same
4. Search operation becomes slower

Correct answer: It reduces the number of comparisons

Copied: 5/12/2026, 12:13:14 PM

Quiz 8 - CS301 (Q10/10)

Question:

Which of the following is a non-linear data structure?

1. Tree