leetcode-111-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.

给定一棵树，找出它从根节点到某一叶子节点的最短路径。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int minDepth(TreeNode* root) {
        if(!root) return 0;
        int minl = minDepth(root->left);
        int minr = minDepth(root->right);
        int minx = min(minl,minr);
        minx==0?minx=minl+minr:minx=minx;
        return minx+1;
    }
};