FilesExpand file tree

master

/

Leetcode_04.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

18 lines (14 loc) · 458 Bytes

master

/

Leetcode_04.java

Copy path

Top

File metadata and controls

• Code
• Blame

18 lines (14 loc) · 458 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

package Leetcode;

//给定一个二叉树，找出其最大深度。

//二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。

public class Leetcode_04 {

public int maxDepth(TreeNode root) {

if (root == null)

return 0;

int left = maxDepth(root.left);

int right = maxDepth(root.right);

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

}

public static void main(String[] args) {

}

}