Given a complete binary tree, count the number of nodes.
Definition of a complete binary tree from Wikipedia:
In a complete binary tree every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible. It can have between 1 and 2h nodes inclusive at the last level h.
解决方案:
1.计算根节点左右子树的深度。
1.1)不同,则说明右侧子树没有零散的点,则可计算出右侧子树节点,递归计算左侧子树。
1.2)相同,则左侧子树无零散的点,可以计算出左侧子树,递归计算右侧子树。