LeetCode--Minimum Depth of Binary Tree

Minimum Depth of Binary Tree

  Total Accepted: 12895  Total Submissions: 44485 My Submissions

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.

　

        本文先参考了http://www.cnblogs.com/remlostime/archive/2012/11/12/2766608.html

法一，递归 --48ms

/**
 * 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) {
        /*
        if(root==NULL)return 0;
        int leftMinDepth=minDepth(root->left);
        int rightMinDepth=minDepth(root->right);
        if(leftMinDepth < rightMinDepth)
        return leftMinDepth+1;
        else return rightMinDepth+1;
        
        if(root==NULL)return 0;
        if(root->left==NULL && root->right==NULL)
            return 1;
        
        int leftMinDepth=minDepth(root->left);
        int rightMinDepth=minDepth(root->right);
        if(leftMinDepth < rightMinDepth)
        return leftMinDepth+1;
        else return rightMinDepth+1;
        */
        if(root==NULL)return 0;
        if(root->left==NULL && root->right==NULL)
            return 1;
        //sum++;
        int leftDepth=minDepth(root->left);
        int rightDepth=minDepth(root->right);

        if(leftDepth==0)
            return rightDepth+1;
        else if(rightDepth==0)
            return leftDepth+1;
        else if(leftDepth < rightDepth)
        return leftDepth+1;
        else return rightDepth+1;
    }
};

法二，层次--52ms

/**
 * 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) {
        if(root==NULL)return 0;
        queue<TreeNode*>Q;
        TreeNode* p=root;
        Q.push(p);
        int levelDepth=1;
        int counter=1;
        while(!Q.empty())
        {
            p=Q.front();
            Q.pop();
            counter--;
            //cout<<p->val<<" ";
            //levelDepth++;
            if(p->left==NULL && p->right==NULL)
                return levelDepth;

            if(p->left!=NULL)
                Q.push(p->left);
            if(p->right!=NULL)
                Q.push(p->right);

            if(counter==0)
            {
                levelDepth++;
                counter=Q.size();
            }
        }

    }
};