How to determine whether a binary tree is complete?

Question

A complete binary tree is defined as a binary tree in which every level, except possibly the deepest, is completely filled. At deepest level, all nodes must be as far left a

Answer 1

You could combine three pieces of information from the subtrees:

• Whether the subtree is complete

• The maximal height

• The minimal height (equal to maximal height or to maximal height - 1)