力扣222题

最新推荐文章于 2024-10-27 05:36:49 发布

你是海波吗

最新推荐文章于 2024-10-27 05:36:49 发布

阅读量37

点赞数

文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/boaboa6/article/details/133935366

版权

题目描述：

1）深度优先

class Solution {
    public int countNodes(TreeNode root) {
        //深度优先 O(n)
        return root == null ? 0 : countNodes(root.left) + countNodes(root.right) + 1;
    }
}

2）广度优先

class Solution {
    public int countNodes(TreeNode root) {
        //广度优先 O(n)
        if(root==null){
            return 0;
        }
        List<TreeNode> list = new ArrayList<>();
        list.add(root);
        for(int i=0;i<list.size();i++){
            if(list.get(i).left!=null){
                list.add(list.get(i).left);
            }
            if(list.get(i).right!=null){
                list.add(list.get(i).right);
            }
        }
        return list.size();
    }
}

3）利用二分法、完全二叉树与二进制的关系优化

完全二叉树与二进制-CSDN博客

class Solution {
    public int countNodes(TreeNode root) {
        //优于 O(n)
        //二分法 节点个数：[2^(n-1),2^n-1]
        if(root==null){
            return 0;
        }
        TreeNode temp = root;
        int n=1; //层数
        while(temp.left != null){
            n++;
            temp = temp.left;
        }

        //int l=(int)Math.pow(2,n-1);
        int l = 1 << (n-1);
        //int r=(int)Math.pow(2,n)-1;
        int r = (1 << n) - 1;
        int mid;
        int wei;

        while(l<=r){
            temp = root;
            mid = (l+r)/2;
            for(int i=n-2;i>=0;i--){
                //wei = mid/(int)Math.pow(2,i)%2;
                wei = (mid >> i)%2;
                if(wei==0){
                    temp = temp.left;
                }else{
                    temp=temp.right;
                }
            }
            if(temp==null){
                r=mid-1;
            }else{
                l=mid+1;
            }
        }
        return r;
    }
}

节点数据结构

/**
 * 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;
 *     }
 * }
 */