FilesExpand file tree

 master

/

Solution55.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

43 lines (38 loc) · 1.29 KB

 master

/

Solution55.java

Copy path

Top

File metadata and controls

• Code
• Blame

43 lines (38 loc) · 1.29 KB

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

34

35

36

37

38

39

40

41

42

43

package com.usher.algorithm.offer;

import java.util.LinkedList;

import java.util.Queue;

/**

* @Author: Usher

* @Description:

* 二叉树的深度

* 递归，深度优先搜索判断左右子树的深度孰大孰小即可，

* 从根节点往下一层树的深度即自增1，遇到NULL时即返回0。

*

* 迭代（队列）层次遍历，树的最大深度为层次遍历搜索中的层数，

* 先把每层父节点push到队列，遍历左右子节点是否为叶子节点，不是就push到队列，删除父节点，

* 直到队列为空

*/

public class Solution55 {

public int TreeDepth(TreeNode root){

if (root == null)

return 0;

Queue<TreeNode> queue = new LinkedList<>();

queue.offer(root);

int max_depth = 0;

while (!queue.isEmpty()){

int size = queue.size();

for (int i = 0;i < queue.size();i++){

TreeNode cur = queue.poll();

if (cur.left != null){

queue.offer(cur.left);

}

if (cur.right != null){

queue.offer(cur.right);

}

}

++max_depth;

}

return max_depth;

//return Math.max(TreeDepth(root.left),TreeDepth(root.right))+1;//递归

}

}