leetcode 222. Count Complete Tree Nodes

Given a complete binary tree, count the number of nodes.

Note:

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.

Example:

Input: 
    1
   / \
  2   3
 / \  /
4  5 6

Output: 6

输出完全二叉树中的节点数

思路：
开始用BFS遍历节点，但是时间复杂度很高，然后用递归的方法，递归返回左子树节点+右子树节点+root节点

//1ms
    public int countNodes(TreeNode root) {
        if (root == null) {
            return 0;
        }
        
        return countNodes(root.left) + countNodes(root.right) + 1;
    }