104. 非递归实现求二叉树的最大深度

最新推荐文章于 2022-10-19 20:26:32 发布

Mrrr_Li

最新推荐文章于 2022-10-19 20:26:32 发布

阅读量229

点赞数

分类专栏：力扣笔记文章标签：算法二叉树队列 leetcode queue

本文链接：https://blog.csdn.net/Mrrr_Li/article/details/110496256

版权

笔记同时被 2 个专栏收录

203 篇文章 1 订阅

订阅专栏

力扣

78 篇文章 0 订阅

订阅专栏

在这里插入图片描述

/**
 * 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 maxDepth(TreeNode root) {
        if (root == null) return 0;
        int height = 0;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        int levelSize = 1;
        while (!queue.isEmpty()){
            levelSize--;
            TreeNode node = queue.poll();

            if (node.left != null) queue.offer(node.left);
            if (node.right != null) queue.offer(node.right);

            if (levelSize == 0){
                levelSize = queue.size();
                height++;
            }

        }
        return height;

    }
}

递归实现

class Solution {
    public int maxDepth(TreeNode root) {
        if (root == null) return 0;
        return Math.max(maxDepth(root.left),maxDepth(root.right)) + 1;

    }
}