CS301P Quiz 4 Set 3

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

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

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

Correct answer: 63

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

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

Correct answer: Strictly Binary Tree

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

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

Correct answer: 1,8,4

Q4. The following method getLeft () of TreeNode class returns the __________ to the left sub-tree. TreeNode * getLeft(){ return left; }

1. None of the given options
2. Integer value
3. Object
4. Pointer

Correct answer: Pointer

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

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

Correct answer: Maximum