蒟蒻的LeetCode刷题记录101~110

101. 对称二叉树
这题的迭代思路跟上一题其实有异曲同工之妙：

/**
 * 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:
    bool isSymmetric(TreeNode* root) {
   
        if (!root) return true;
        return dfs(root->left, root->right);
    }

    bool dfs(TreeNode* p, TreeNode* q) {
   
        if (!p && !q) return true;
        if (!p || !q || p->val != q->val) return false;
        return dfs(p->left, q->right) && dfs(p->right, q->left);
    } 
};

class Solution {
   
public:
    bool isSymmetric(TreeNode* root) {
   
        if (!root) return true;
        stack<TreeNode*> left, right;
        TreeNode *lc = root->left;
        TreeNode *rc = root->right;
        while(lc || rc || left.size()) {
   
            while (lc && rc) {
   
                left.push(lc), right.push(rc);
                lc = lc->left, rc = rc->right;
            }
            if (lc || rc) return false;
            lc = left.top(), rc = right.top();
            left.pop(), right.pop();
            if (lc->val != rc->val) return false;
            lc = lc->right, rc = rc->left;
        }
        return true;
    }
};

102. 二叉树的层序遍历
宽搜的模板题：

/**
 * 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:
    vector<vector<int>> levelOrder(TreeNode* root) {
   
        vector<vector<int>> res;
        queue<TreeNode*> q;//bfs当然就是得用到队列了
        if (root) q.push(root);//根节点不空，就把根节点放到队列里

        while (q.size()) {