forked from algorithm001/algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetcode_104_140.java
More file actions
36 lines (33 loc) · 775 Bytes
/
Leetcode_104_140.java
File metadata and controls
36 lines (33 loc) · 775 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
/**
* 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.
*
* Note: A leaf is a node with no children.
*
* Example:
*
* Given binary tree [3,9,20,null,null,15,7],
*
* 3
* / \
* 9 20
* / \
* 15 7
* return its depth = 3.
*/
public class Leetcode_104_140 {
public int maxDepth(TreeNode root) {
return(depth(root, 0));
}
int depth(TreeNode node, int depth) {
if(node == null) return depth;
return Math.max(depth(node.left, depth+1), depth(node.right, depth+1));
}
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
}