111. Minimum Depth of Binary Tree#1(Done)

来源:互联网 发布:电脑桌面图片制作软件 编辑:程序博客网 时间:2024/05/19 17:26

Solution

/** * Definition for a binary tree node. * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode(int x) { val = x; } * } */public class Solution {    public int minDepth(TreeNode root) {        if (root == null) {            return 0;        }        return getMin(root);    }    public int getMin(TreeNode root) {        if (root == null) {            return Integer.MAX_VALUE;        }        if (root.left == null && root.right == null) {            return 1;        }        return Math.min(getMin(root.left), getMin(root.right)) + 1;    }}

Problem#1

0 0
原创粉丝点击