FilesExpand file tree

 master

/

MinimumDepthofBinaryTree.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

23 lines (20 loc) · 590 Bytes

 master

/

MinimumDepthofBinaryTree.java

Top

File metadata and controls

• Code
• Blame

23 lines (20 loc) · 590 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

/**

* 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.

*/

public class MinimumDepthofBinaryTree {

public int minDepth(TreeNode root) {

if (root == null)

return 0;

if (root.left == null && root.right == null)

return 1;

else {

int leftDepth = root.left != null ? minDepth(root.left)

: Integer.MAX_VALUE;

int rightDepth = root.right != null ? minDepth(root.right)

: Integer.MAX_VALUE;

return Math.min(leftDepth, rightDepth) + 1;

}

}

}