CS301P Quiz 4 Set 2

VU TOOLKIT · CS301P - Quiz No.4 · Date: 04 May 2026

Q1. A binary tree in which every non-leaf node has non-empty right and left subtrees is called:

1. Huffman Tree
2. Graph
3. Strictly Binary Tree
4. AVL Tree

Correct answer: Strictly Binary Tree

Q2. The depth of a complete binary tree is 6 , the number of its non-leaf nodes will be:

1. 63
2. 64
3. 6
4. 61

Correct answer: 63

Q3. A new node is added at the __________ of queue.

1. Front
2. None of the given options
3. Rear
4. Middle

Correct answer: Rear

Q4. The ________ level of any leaf in a binary tree is called the depth of the tree

1. Zero
2. Maximum
3. Mid
4. Minimum

Correct answer: Maximum

Q5. Which of the following queue does not always follow FIFO behavior?

1. Circular queue
2. Double-ended queue
3. Simple queue
4. Priority queue

Correct answer: Priority queue