leetcode222. 完全二叉树的节点个数

题目描述

给你一棵 完全二叉树 的根节点 root ，求出该树的节点个数。

完全二叉树 的定义如下：在完全二叉树中，除了最底层节点可能没填满外，其余每层节点数都达到最大值，并且最下面一层的节点都集中在该层最左边的若干位置。若最底层为第 h 层，则该层包含 1~ 2h 个节点。

题解

解1

/**
 2. Definition for a binary tree node.
 3. public class TreeNode {
 4.     int val;
 5.     TreeNode left;
 6.     TreeNode right;
 7.     TreeNode() {}
 8.     TreeNode(int val) { this.val = val; }
 9.     TreeNode(int val, TreeNode left, TreeNode right) {
 10.         this.val = val;
 11.         this.left = left;
 12.         this.right = right;
 13.     }
 14. }
 */
class Solution {
    public int countNodes(TreeNode root) {
        if(root == null) {
            return 0;
        }
        return countNodes(root.left) + countNodes(root.right) + 1;
    }
}

解2

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    int res = 0;
    public int countNodes(TreeNode root) {
        dfs(root);
        return res;
    }
    public void dfs(TreeNode node) {
        if(node == null) {
            return;
        }
        res++;
        dfs(node.left);
        dfs(node.right);
    }
}