Skip to main content

Full / Complete / Perfect Binary Tree

Learn Full / Complete / Perfect Binary Tree (Trees, Data Structures & Algorithms) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

Three Different Shape Constraints Full (or "proper"): every node has 0 or 2 children - never exactly 1. Complete: every level is fully filled except possibly the last, and the last level's nodes are filled LEFT to RIGHT with no gaps. This shape is exactly what a binary heap requires, since it enables an array-based representation with no wasted slots. Perfect: ALL levels are completely filled - every leaf is at the same depth. A perfect tree is both full and complete.

More lessons in Trees