FilesExpand file tree

 master

/

104_MaximumDepthOfBinaryTree104.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

33 lines (26 loc) · 654 Bytes

 master

/

104_MaximumDepthOfBinaryTree104.java

Copy path

Top

File metadata and controls

• Code
• Blame

33 lines (26 loc) · 654 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

/**

* 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; }

* }

*/

import java.util.Stack;

public class MaximumDepthOfBinaryTree104 {

public int maxDepth(TreeNode root) {

if (root == null){

return 0;

}

int left = maxDepth(root.left);

int right = maxDepth(root.right);

return Math.max(left, right) + 1;

}

}