leetcode[111]:Minimum Depth of Binary Tree

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;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
int minDepth(struct TreeNode* root)  {

    int i, j;

    i=j=1;

    if(!root) return 0;
    if(!root->left && !root->right) return 1;
    if(root->left && root->right) 
    {   
        i += minDepth(root->left);
        j += minDepth(root->right); 
        if( i < j ) return i;
        return j;
    }
    if(!root->left && root->right)  {i += minDepth(root->right); return i;}
    if(!root->right && root->left)  {j += minDepth(root->left); return j;}

}  

递归查询，注意一个子树为空的情况。