Binary tree

What is a full binary tree?

• a) Each node has exactly zero or two children

• b) Each node has exactly two children

• c) All the leaves are at the same level

• d) Each node has exactly one or two children

What is a complete binary tree?

• a) Each node has exactly zero or two children

• b) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left

• c) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right

• d) A tree In which all nodes have degree 2

The no of external nodes in a full binary tree with n internal nodes is?

• a) n

• b) n+1

• c) 2n

• d) 2n + 1

Which of the following statement about binary tree is CORRECT?

• a) Every binary tree is either complete or full

• b) Every complete binary tree is also a full binary tree

• c) Every full binary tree is also a complete binary tree

• d) A binary tree cannot be both complete and full

In full binary search tree every internal node has exactly two children. If there are 100 leaf nodes in the tree, how many internal nodes are there in the tree?

• a) 25

• b) 49

• c) 99

• d) 101

Suppose a complete binary tree has height h>0. The minimum no of leaf nodes possible in term of h is?

• a) 2^h -1

• b) 2^{h -1} + 1

• c) 2^{h -1}

• d) 2^h +1