LeetCode_226_翻转二叉树

迭代法（通过层序遍历）反转：

swap(x, y)用来交换x和y的值，不用判断cur->left和cur->right是否存在，因为swap可以交换null和数值。
传入cur之后交换cur的结点就是交换原root的结点。

/**
 * 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:
    TreeNode* invertTree(TreeNode* root) {
        queue<TreeNode*> que;
        if (root != NULL) que.push(root);
        while (!que.empty()) {
            int size = que.size();
            for (int i = 0; i < size; i++) {
                TreeNode* cur = que.front();
                que.pop();
                swap(cur->left, cur->right);
                if (cur->left) que.push(cur->left); //这两行可交换
                if (cur->right) que.push(cur->right);
            }
        }
        return root;
    }
};

---

递归法反转：

class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        queue<TreeNode*> que;
        if (root == NULL) return root;
        swap(root->left, root->right);
        invertTree(root->left); //这两行可交换
        invertTree(root->right);
        return root;
    }
};