FilesExpand file tree

 master

/

MinimumDepthOfBinaryTree111.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

58 lines (55 loc) · 1.33 KB

 master

/

MinimumDepthOfBinaryTree111.java

Copy path

Top

File metadata and controls

• Code
• Blame

58 lines (55 loc) · 1.33 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

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

/**

* Given a binary tree, find its minimum depth.

*

* The minimum depth is the number of nodes along the shortest path from the

* root node down to the nearest 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 minimum depth = 2.

*

*/

/**

* Definition for a binary tree node.

* public class TreeNode {

* int val;

* TreeNode left;

* TreeNode right;

* TreeNode(int x) { val = x; }

* }

*/

public class MinimumDepthOfBinaryTree111 {

public int minDepth(TreeNode root) {

if (root == null) return 0;

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

int depth = 1;

q.add(root);

while (!q.isEmpty()) {

int size = q.size();

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

TreeNode node = q.remove();

boolean isLeaf = true;

if (node.left != null) {

isLeaf = false;

q.add(node.left);

}

if (node.right != null) {

isLeaf = false;

q.add(node.right);

}

if (isLeaf) return depth;

}

depth++;

}

return depth;

}

}