leetcode:111. 二叉树的最小深度(dfs)

package LeetCode;
/*
给定一个二叉树，找出其最小深度。

最小深度是从根节点到最近叶子节点的最短路径上的节点数量。

说明: 叶子节点是指没有子节点的节点。

示例:

给定二叉树 [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7
 */
public class MinDepth {
    int count = Integer.MAX_VALUE;

    public int minDepth(TreeNode root) {
        if (root == null) return 0;
        if (root.left == null && root.right == null) return 1;
        if (root.left != null)
            dfs(root.left, 2);
        if (root.right != null)
            dfs(root.right, 2);
        return count;
    }

    public void dfs(TreeNode node, int res) {
        if (res > count) return;
        if (node.left == null && node.right == null) {
            if (res < count) {
                count = res;
            }
            return;
        }
        if (node.left != null)
            dfs(node.left, res + 1);
        if (node.right != null)
            dfs(node.right, res + 1);
    }

    public static void main(String[] args) {
        TreeNode t1 = new TreeNode(1);
        TreeNode t2 = new TreeNode(2);
        TreeNode t3 = new TreeNode(3);
        TreeNode t4 = new TreeNode(4);
        TreeNode t5 = new TreeNode(5);
        t1.left = t2;
        t1.right = t3;
        t3.left = t4;
        t2.right = t5;
        MinDepth minDepth = new MinDepth();
        minDepth.minDepth(t1);
    }
}