2021-11-25 222. 完全二叉树的节点个数

最新推荐文章于 2024-11-08 15:35:46 发布

rookieyx

最新推荐文章于 2024-11-08 15:35:46 发布

阅读量71

点赞数

分类专栏：力扣文章标签：完全二叉树层序遍历节点计数队列 TreeNode

本文链接：https://blog.csdn.net/m0_52001011/article/details/121546260

版权

力扣专栏收录该内容

64 篇文章 0 订阅

订阅专栏

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

方法一：层序遍历

/**
 * 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 {
    public int countNodes(TreeNode root) {
        int count = 0;
        if(root == null) return 0;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while(!queue.isEmpty()){
            int n = queue.size();
            while(n > 0){
                TreeNode node = queue.poll();
                count++;
                if(node.left != null) queue.offer(node.left);
                if(node.right != null) queue.offer(node.right);
                n--;
            }
        } 
        return count;
    }
}