-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathjava_104.java
More file actions
42 lines (39 loc) · 826 Bytes
/
Copy pathjava_104.java
File metadata and controls
42 lines (39 loc) · 826 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
42
package leetcode;
/**
* leetcode_104
*
* 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 a binary tree node.
*
* public class TreeNode {
*
* int val;
*
* TreeNode left;
*
* TreeNode right;
*
* TreeNode(int x) { val = x; }
*
* }
*/
public class java_104 {
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
public int maxDepth(TreeNode root) {
//DFS
if (root == null) {
return 0;
}
int left_len = maxDepth(root.left);
int right_len = maxDepth(root.right);
return left_len > right_len ? left_len+1 : right_len+1;
}
}