-
Notifications
You must be signed in to change notification settings - Fork 2
/
HeightOfBinaryTree.java
64 lines (53 loc) · 1.34 KB
/
HeightOfBinaryTree.java
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
package Leetcode;
/**
* @author kalpak
*
* Given the root of a binary tree, return its maximum depth.
*
* A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
*
*
* Example 1:
* Input: root = [3,9,20,null,null,15,7]
* Output: 3
*
* Example 2:
* Input: root = [1,null,2]
* Output: 2
*
* Example 3:
* Input: root = []
* Output: 0
*
* Example 4:
* Input: root = [0]
* Output: 1
*
* Constraints:
*
* The number of nodes in the tree is in the range [0, 104].
* -100 <= Node.val <= 100
*/
public class HeightOfBinaryTree {
public static int maxDepth(TreeNode root) {
if (root == null)
return 0;
int left = maxDepth(root.left);
int right = maxDepth(root.right);
return (1 + Math.max(left, right));
}
public static void main(String[] args) {
TreeNode root = new TreeNode(3);
root.left = new TreeNode(9);
root.right = new TreeNode(20);
root.left.left = null;
root.left.right = null;
root.right.left = new TreeNode(15);
root.right.right = new TreeNode(7);
root.right.left.left = null;
root.right.left.right = null;
root.right.right.left = null;
root.right.right.right = null;
System.out.println(maxDepth(root));
}
}