牛客网：NC84 完全二叉树结点数

what is an object

已于 2022-08-03 12:48:48 修改

阅读量211

点赞数

分类专栏：菜鸟刷题记录算法

于 2022-08-03 12:48:47 首次发布

本文链接：https://blog.csdn.net/newOneObject/article/details/126138098

版权

leetcode 算法 c++

算法同时被 2 个专栏收录

278 篇文章 1 订阅

订阅专栏

菜鸟刷题记录

204 篇文章 1 订阅

订阅专栏

直接遍历

/**
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }
}*/
public class Solution {
    public int nodeNum(TreeNode head) {
        if (head == null){
            return 0;
        }
        return 1 + nodeNum(head.left) + nodeNum(head.right);
    }
}

使用满二叉树的性质

/**
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }
}*/
public class Solution {
    public int nodeNum(TreeNode head) {
        if (head == null){
            return 0;
        }
        int left = getHeight(head.left);
        int right = getHeight(head.right);
        if (left != right){
            return (int)Math.pow(2, right) + nodeNum(head.left); 
        } 
        return (int)Math.pow(2, left)  + nodeNum(head.right);
    }
    
    private int getHeight(TreeNode node){
        TreeNode cur = node;
        int res = 0;
        while (cur != null){
            cur = cur.left;
            res++;
        }
        return res;
    }
}