LeetCode@Tree_100_Max_Depth_B_Tree

104. Maximum Depth of Binary Tree

DescriptionHintsSubmissionsSolutions

• 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));}}}