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.

即求根结点到其叶节点的最短距离。

简单地用BFS就可以解决问题，在用队列对访问的结点进行操作的同时同步对记录结点深度的队列进行相应的操作。因为BFS是逐层访问树的结点的，当访问到一个结点它没有左右结点时，该结点的深度就是所求的最短距离。代码如下：

/**
 * 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) {
        queue<TreeNode*> sq;
        queue<int> depth;
        int deep;
        TreeNode *temp;
        if(!root) return 0;
        sq.push(root);
        depth.push(1);
        while(!sq.empty()){
            temp = sq.front();
            sq.pop();
            deep = depth.front();
            depth.pop();
            if(temp->left == NULL && temp->right == NULL) return deep;
            if(temp->left != NULL) {sq.push(temp->left);depth.push(deep+1);}
            if(temp->right != NULL) {sq.push(temp->right);depth.push(deep+1);}
        }
        return 0;
    }
};

在做题的时候出现了一个错误，不知道错在哪里，忘各位大神指导指导，错误代码如下：

class Solution {
public:
    int minDepth(TreeNode* root) {
        queue<TreeNode> sq;
        queue<int> depth;
        int deep;
        TreeNode *temp;
        if(!root) return 0;
        sq.push(*root);
        depth.push(1);
        while(!sq.empty()){
            *temp = sq.front();
            sq.pop();
            deep = depth.front();
            depth.pop();
            if(temp->left == NULL && temp->right == NULL) return deep;
            if(temp->left != NULL) {sq.push(*(temp->left));depth.push(deep+1);}
            if(temp->right != NULL) {sq.push(*(temp->right));depth.push(deep+1);}
        }
        return 0;
    }
};