LeetCode_101_对称二叉树

自己写的

通过层序遍历，判断每层结点组成的vector是否和他本身的反转相等，如果相等，则对称。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool isSymmetric(TreeNode* root) {        
        queue<TreeNode*> que;
        bool result = true;
        if (root != NULL) que.push(root);
        while (!que.empty()) {            
            vector<int> vec;
            int size = que.size();
            for (int i = 0; i < size; i++) {
                TreeNode* cur = que.front();
                que.pop();
                if (cur == NULL) {
                    vec.push_back(110); //任意数，因为题目给定-100 <= Node.val <= 100
                } else {
                    vec.push_back(cur->val);
                    if (cur->left && cur->right) {
                        que.push(cur->left);
                        que.push(cur->right);                    
                    }
                    else if (cur->left && !cur->right) {
                        que.push(cur->left);
                        que.push(NULL);                    
                    }
                    else if (!cur->left && cur->right) {
                        que.push(NULL); 
                        que.push(cur->right);
                    }
                    else{
                        que.push(NULL);
                        que.push(NULL);
                    }
                }
            }
            vector<int> revec = vec;
            reverse(revec.begin(), revec.end());            
            if (revec != vec) result = false;
        }
        return result;
    }
};

其实对称的好像用栈会更适合。