Perfect Binary Tree (完美二叉树)

Abstract

---

• A Tree only has nodes that have a Degree of 0 or 2 AND the nodes with degree 0 is on the last Level
• Complete Binary Tree (完全二叉树) whose Depth of the left most branch is same as the depth of the right most branch

Calculate total number of nodes

$total=2^{height+1}-1$. This operation takes $logn$ time, because we need to go to the bottom of the tree from one side to find the Tree Height.

Question Bank

Properties

• 222. Count Complete Tree Nodes