Maximum Depth of Binary Tree (Java)

最新推荐文章于 2021-08-04 16:06:57 发布

豆腐脑是咸的

最新推荐文章于 2021-08-04 16:06:57 发布

阅读量359

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode easy DFS Tree 文章标签： LeetCode Binary Tree 指针

本文链接：https://blog.youkuaiyun.com/tofu_jelly/article/details/42124555

LeetCode easy 同时被 3 个专栏收录

39 篇文章

订阅专栏

Tree

25 篇文章

订阅专栏

DFS

21 篇文章

订阅专栏

本文介绍了一种求解二叉树最大深度的递归算法，并通过实例演示了该算法的具体实现过程。最大深度是指从根节点到最远叶子节点的最长路径上的节点数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Source

public int maxDepth(TreeNode root) {
        int left, right;
		if(root == null) return 0;
        
        if(root.left == null && root.right == null){
        	return 1;
        }
        
        if(root.left == null){
        	left = Integer.MIN_VALUE;
        }
        else left = maxDepth(root.left);
        
        if(root.right == null){
        	right = Integer.MIN_VALUE;
        }
        else right = maxDepth(root.right);
        
        return Math.max(left, right)+1;
    }

Test

public static void main(String[] args){
		TreeNode a = new TreeNode(5);
    	a.left = new TreeNode(4);
    	a.right = new TreeNode(8);
    	a.left.left = new TreeNode(11);
    	a.left.left.left = new TreeNode(7);
    	a.left.left.right = new TreeNode(2);
    	a.right.left = new TreeNode(13);
    	a.right.right = new TreeNode(4);
    	a.right.right.right = new TreeNode(1);
    	System.out.println(new Solution().maxDepth(a));
	}