Leetcode Minimum Depth of Binary Tree

简单的dfs。每到一个节点，先判断是否为空，然后判断是否为叶子节点，两者都不是的话，就继续dfs该节点的左右节点。

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int minDepth(TreeNode *root) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(!root)   return 0;
        minn = INT_MAX;
        dfs(root, 0);
        return minn;
    }
    void dfs(TreeNode *root, int depth){
        if(!root)   return ;
        if(!root->left && !root->right){
            minn = depth+1 < minn ? depth+1 : minn;
            return ;
        }
        dfs(root->left, depth+1);
        dfs(root->right, depth+1);
    }
    int minn;
};