CS301P Quiz 4

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

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

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

Correct answer: Strictly Binary Tree

Q2. If there is a complete binary tree of depth 4, the total number of nodes in it will be:

1. 32
2. 33
3. 31
4. 30

Correct answer: 31

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

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

Correct answer: 6

Q4. Which of the following are the leaf nodes in given tree?

1. 1,8,3
2. 1,5,3
3. 1,8,4
4. 1,5,8

Correct answer: 1,8,4

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

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

Correct answer: Priority queue