[leetcode]Same Tree

Given two binary trees, write a function to check if they are equal or not.
Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

不用解释吧。

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isSameTree(TreeNode *p, TreeNode *q) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        queue<TreeNode*> q1;
        queue<TreeNode*> q2;
        q1.push(p);
        q2.push(q);
        while(!q1.empty())
        {
            TreeNode * tmp1 = q1.front();
            TreeNode * tmp2 = q2.front();
            q1.pop();
            q2.pop();
            if(tmp1 == NULL && tmp2 == NULL)
                continue;
            if(tmp1 == NULL || tmp2 == NULL)
                return false;
            if(tmp1->val != tmp2->val)
                return false;
            q1.push(tmp1->left);
            q1.push(tmp1->right);
            q2.push(tmp2->left);
            q2.push(tmp2->right);
        }
        return true;
    }
};