LeetCode@Tree_100_Max_Depth_B_Tree_b tree leetcode

作者：itdef | 2024-02-06 13:29:28

踩

b tree leetcode

104. Maximum Depth of Binary Tree

Description Hints Submissions Solutions

Total Accepted: 241399
Total Submissions: 462901
Difficulty: Easy
Contributor: LeetCode

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.

Subscribe to see which companies asked this question.

Hide Tags

Tree Depth-first Search

Hide Similar Problems

(E) Balanced Binary Tree (E) Minimum Depth of Binary Tree

Java:


/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    
	public int maxDepth(TreeNode root)
	{
		int h = 0;
		if(root == null)
		{
			return h;
		}
		else
		{
			return 1+Math.max(maxDepth(root.left), maxDepth(root.right));
		}
 
	}
}

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/itdef/article/detail/62927