Question

A binary tree having r nodes and depth d is said to be complete binary tree if

• A. Any node and at level less than d-$1$ has two sons
• B. It contains $2^{d+1}-1$ nodes
• C. For any node and in the tree with a right descendent at level d, and must have a left child.
• D. All of the above

Answer 1

The correct option is D All of the above

A binary tree having r nodes and depth d is said to be complete binary tree if

1) Any node and at level less than d-1 has two sons.

2) It contains 2^d+1 -1 nodes.

3) For any node and in the tree with a right descendent at level d, and must have a left child.

A binary tree is made of nodes, where each node contains a "left" reference, a "right" reference, and a data element. The topmost node in the tree is called the root. Every node in a tree is connected by a directed edge from exactly one other node. This node is called a parent.