-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMaximum_Depth_of_Binary_Tree.java
More file actions
41 lines (31 loc) · 1022 Bytes
/
Copy pathMaximum_Depth_of_Binary_Tree.java
File metadata and controls
41 lines (31 loc) · 1022 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
104. Maximum Depth of Binary Tree
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.
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public int maxDepth(TreeNode root) {
// Start typing your Java solution below
// DO NOT write main() function
if(root==null) return 0;
return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
}
}
///////////////////////////////////////////////////////////////////////////
public class Solution {
public int maxDepth(TreeNode root) {
// Start typing your Java solution below
// DO NOT write main() function
if(root==null)
return 0;
int h = Math.max(maxDepth(root.left), maxDepth(root.right));
return h+1;
}
}