Abstract
- When a Binary Tree (二叉树) only has nodes that have a Degree of 0 or 2 AND the nodes Degree 0 is on the last Level
- If the Depth of the left most branch is same as the Depth of the right most branch AND it is a Complete Binary Tree (完全二叉树)
Calculate total number of nodes
- Total nodes = 2^(Height+1) -1
- Time complexity = log(n), because we just need to go to the bottom from one side to find the Height
- Space complexity = O(1)