CS301P Solved Lab Quiz 4 by Sahirullah

CS301P - Data Structures (Practical)

Lab 4 Quiz Solutions

Solved by: Sahirullah | | info.sahirweb

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

Minimum

Maximum

Zero

Mid

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

Q3. The following method getLeft() of TreeNode class returns the ________ to the left sub- tree:

TreeNode * getLeft(){ return left; }

Object

None of the given options

Integer value

Pointer

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

Q5. Which of the following is true about binary trees?

Parent node of two sibling nodes must be same

A binary tree should have only one leaf node

A binary tree should have two root nodes

A node can have multiple parent nodes