Define A Complete Binary Tree?

1.	Define A Complete Binary Tree?
Answer» A COMPLETE BINARY tree is a tree in which every non-leaf NODE has EXACTLY two CHILDREN not necessarily to be on the same level. A complete binary tree is a tree in which every non-leaf node has exactly two children not necessarily to be on the same level.

Answer»

A COMPLETE BINARY tree is a tree in which every non-leaf NODE has EXACTLY two CHILDREN not necessarily to be on the same level.

A complete binary tree is a tree in which every non-leaf node has exactly two children not necessarily to be on the same level.

Discussion