Complete Binary Tree

overview

Remember these Terms

• Complete Binary Tree: all levels filled except possibly the last, which is filled left to right.
• Perfect Binary Tree: every level filled; all leaves at the same depth.
• Full Binary Tree: each node has 0 or 2 children; not about left-right filling.
• Height (or Depth): number of edges on the longest root-to-leaf path.
• Array Representation: with 1-based indexing, node i has children 2i and 2i+1; parent floor(i/2).
• Heap: a complete binary tree with a min- or max-order key property.