LeetCode226 翻转二叉树

翻转一棵二叉树。

示例：

输入：

4
/
2 7
/ \ /
1 3 6 9
输出：

4
/
7 2
/ \ /
9 6 3 1

/**
 * 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:
    TreeNode* invertTree(TreeNode* root) {
        
        if(root == NULL)
            return root;
        
        invertTree(root->left);
        invertTree(root->right);
        swap(root->left, root->right);
        
        return root;
    }
};

//迭代
class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        
        if(root == NULL)
            return root;
        
        queue<TreeNode*> q;
        q.push(root);
        
        while( !q.empty() ){
            TreeNode* curNode = q.front();
            q.pop();
            swap(curNode->left, curNode->right);
            
            if(curNode->left)
                q.push(curNode->left);
            
            if(curNode->right)
                q.push(curNode->right);
        }
        
        return root;
    }
};