LeetCode-Minimum Depth of Binary Tree

题目：https://oj.leetcode.com/problems/minimum-depth-of-binary-tree/

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.

算法分析：时间复杂度O(n)，空间复杂度O(logn)。

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    private int minDepth=Integer.MAX_VALUE;
    
    public int minDepth(TreeNode root) {
        if(root==null) {
            return 0; 
        }
        DFS(root,1);
        return minDepth;
    }
    
    public void DFS(TreeNode node,int depth) {
        if(node.left==null && node.right==null) {
            if(depth<minDepth) {
                minDepth=depth;
            }
        }
        if(node.left!=null) {
            DFS(node.left,depth+1);
        }
        if(node.right!=null) {
            DFS(node.right,depth+1);
        }
    }
}