Answer to Question #153295 in Programming & Computer Science for Rashinda

Question

Explain the difference between a complete binary tree and a perfect binary tree

Answer 1

A complete binary tree of height $h$ could be one in which all nodes up to level $h$ have two children.

A full binary tree has all it's nodes with either none or two children. A perfect binary tree is a tree which is both full and complete.