Define A Full Binary Tree ?

1.	Define A Full Binary Tree ?
Answer» A full binary tree is a tree in which all the LEAVES are on the same LEVEL and EVERY non-leaf node has exactly TWO CHILDREN. A full binary tree is a tree in which all the leaves are on the same level and every non-leaf node has exactly two children.

Answer»

A full binary tree is a tree in which all the LEAVES are on the same LEVEL and EVERY non-leaf node has exactly TWO CHILDREN.

A full binary tree is a tree in which all the leaves are on the same level and every non-leaf node has exactly two children.

Discussion