(java)(leecode)222. 完全二叉树的节点个数

Src: https://leetcode-cn.com/problems/count-complete-tree-nodes/

这个时间有点奇怪

执行用时: 0 ms 内存消耗: 41 MB

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