Count Complete Tree Nodes

最新推荐文章于 2021-10-09 17:34:29 发布

cgdong2014

最新推荐文章于 2021-10-09 17:34:29 发布

阅读量284

点赞数

分类专栏： LeetCode Tree Remember Review Binary Search

本文链接：https://blog.csdn.net/cgdong2014/article/details/47395607

版权

LeetCode 同时被 3 个专栏收录

139 篇文章 0 订阅

订阅专栏

Review

51 篇文章 0 订阅

订阅专栏

Remember

35 篇文章 0 订阅

订阅专栏

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.

Show Tags

Have you met this question in a real interview?

思路： Using height to make it to compare countLeft with countRight. Then, recursion to resolve the subquestion.

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int countNodes(TreeNode root) {
        if(root == null)
            return 0;
        int leftHeight = countHelper(root.left);
        int rightHeight = countHelper(root.right);
        if(leftHeight == rightHeight)
            return (1 << leftHeight) + countNodes(root.right);
        return (1 << rightHeight) + countNodes(root.left);
    }
    
    private int countHelper(TreeNode root){
        int height = 0;
        while(root != null){
            height++;
            root = root.left;
        }
        return height;
    }
}