算法-树-二叉树的最大深度

最新推荐文章于 2024-09-07 20:59:49 发布

千鸟送天

最新推荐文章于 2024-09-07 20:59:49 发布

阅读量63

点赞数

分类专栏：力扣

本文链接：https://blog.csdn.net/qq_45100361/article/details/113401672

版权

力扣专栏收录该内容

111 篇文章 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;
        }

        //如果为空  直接返回0
        int a = maxDepth(root.left);

        int b = maxDepth(root.right);

        return Math.max(a, b) + 1;//加上根节点的层数
        
    }
}

方法二广度优先搜索

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

        Queue<TreeNode> queue = new LinkedList<>();

        queue.offer(root);
        int ans = 0;
        while(!queue.isEmpty()) {
            //记录每一行的节点个数 一行全部从队列拿完ans就加一
            int size = queue.size();
            while(size > 0) {
                TreeNode cur = queue.poll();
                //拿出一个size--
                size--;
                if(cur.left != null) {
                    queue.offer(cur.left);
                }

                if(cur.right != null) {
                    queue.offer(cur.right);
                }
            }
            //一行拿完
            ans++;
        }
        return ans;
    }
}