代码随想录Day016 | Leetcode 104.二叉树的最大深度 、Leetcode 111.二叉树的最小深度、Leetcode 222.完全二叉树的节点个数

104.二叉树的最大深度

class Solution {
    public int maxDepth(TreeNode root) {
        if (root == null) {
            return 0;
        } else if (root.left == null && root.right == null) {
            return 1;
        } else {
            Queue<TreeNode> queue = new LinkedList();
            queue.offer(root);
            TreeNode curEndNode = root;
            TreeNode nextEndNode = null;

            int height = 0;
            while (!queue.isEmpty()) {
                TreeNode poll = queue.poll();


                if (poll.left != null) {
                    queue.offer(poll.left);
                    nextEndNode = poll.left;
                }
                if (poll.right != null) {
                    queue.offer(poll.right);
                    nextEndNode = poll.right;
                }
                if (poll == curEndNode) {
                    curEndNode = nextEndNode;
                    height++;
                }
            }
            return height;
        }


    }
}

111.二叉树的最小深度

class Solution {
    public int minDepth(TreeNode root) {
        if (root == null) {
            return 0;
        } else if (root.left == null && root.right == null) {
            return 1;
        }
        Queue<TreeNode> queue = new LinkedList<>();

        queue.offer(root);
        TreeNode curEndNode = root;
        TreeNode nextEndNode = null;
        int height = 1;
        while (!queue.isEmpty()) {
            TreeNode poll = queue.poll();
            if (poll.left == null && poll.right == null) {
                break;
            }
            if (poll.left != null) {
                queue.offer(poll.left);
                nextEndNode = poll.left;
            }
            if (poll.right != null) {
                queue.offer(poll.right);
                nextEndNode = poll.right;
            }
            if (poll == curEndNode) {
                curEndNode = nextEndNode;
                height++;
            }


        }
        return height;
    }
}

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

class Solution {
    public int countNodes(TreeNode root) {
        if (root == null) {
            return 0;
        } else if (root.left == null) {
            return 1;
        } else if (root.right == null) {
            return 2;
        }
        Queue<TreeNode> queue = new LinkedList();
        queue.offer(root);
        int cnt = 0;
        while (!queue.isEmpty()) {
            TreeNode poll = queue.poll();
            cnt++;
            if (poll.left == null || (poll.left != null && poll.right == null)) {
                if (poll.left != null) {
                    queue.offer(poll.left);
                }
                while (!queue.isEmpty()) {
                    queue.poll();
                    cnt++;
                }
            } else {
                queue.offer(poll.left);
                queue.offer(poll.right);

            }
        }
        return cnt;

    }
}