111. Minimum Depth of Binary Tre

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.

Solution:

/**
 * 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:
    inline int min(int a, int b){
        return a > b ? b : a;
    }
    int minDepth(TreeNode* root) {
        if(NULL == root) return 0;
        else if(NULL == root->left && NULL == root->right) return 1;
        else if(NULL == root->left && NULL != root->right) return minDepth(root->right) + 1;
        else if(NULL != root->left && NULL == root->right) return minDepth(root->left) + 1;
        else return min(minDepth(root->left), minDepth(root->right)) + 1;
    }
};