Abstract
- Perfect Binary Tree (完美二叉树) except the last level may not completely filled
- The nodes on the last level are strictly arranged from left to right
- Perfect binary trees are often used to implement binary heaps
- We can use Binary Tree Array Representation to implement the complete binary tree
Question Bank