CS301 Quiz 2 May 2026 Set 2

Quiz 1 - CS301 (Q1/10)

Question:

In a complete binary tree the number of nodes at level 5 are

A. 31

B. 16 C. 32 D. 15 Copied: 5/12/2026, 12:19:06 PM

Quiz 2 - CS301 (Q2/10)

Question:

When a function calls another function, the parameters and return address of the calling function are put in

A. Queue

B. Stack

C. Binary Tree D. Heap Copied: 5/12/2026, 12:20:04 PM

Quiz 3 - CS301 (Q3/10)

Question:

Longest path from root node to farthest leaf node is called ________ of tree

A. Length

B. Level

C. Depth

D. Node level Copied: 5/12/2026, 12:20:26 PM

Quiz 4 - CS301 (Q4/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 preorder and inorder traversal only
3. In postorder 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:20:59 PM

Quiz 5 - CS301 (Q5/10)

Question:

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

A. Through both recursive method call and non-recursive method call B. Only through non-recursive method

C. Only through recursive method

D. Through max-heap Copied: 5/12/2026, 12:21:19 PM

Quiz 6 - CS301 (Q6/10)

Question:

During in-order traversal using recursive calls, if we found a node is NULL. It means this node will satisfy following condition.

A. It will not have both left and right children B. It will have only left child C. It will not have right child

D. It will not have left child

Copied: 5/12/2026, 12:21:51 PM

Quiz 7 - CS301 (Q7/10)

Question:

When a function calling itself is called as __________.

A. Nested loop B. Inline C. Iteration

D. Recursion

Copied: 5/12/2026, 12:22:21 PM

Quiz 8 - CS301 (Q8/10)

Question:

For a complete binary tree with n numbers of nodes, the depth is calculated as ____________