[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 binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int depth(TreeNode *node)
    {
        if(node==NULL)
            return 0;
        int leftDepth=depth(node->left);
        int rightDepth=depth(node->right);
        if(node->left==NULL)
            return rightDepth+1;
        if(node->right==NULL)
            return leftDepth+1;
        return leftDepth<rightDepth?leftDepth+1:rightDepth+1;
    }
    int minDepth(TreeNode *root) {
        if(root==NULL)
            return 0;
        int leftDepth=depth(root->left);
        int rightDepth=depth(root->right);
        if(root->left==NULL)
            return rightDepth+1;
        if(root->right==NULL)
            return leftDepth+1;
        return leftDepth<rightDepth?leftDepth+1:rightDepth+1;
    }
};