Leetcode:226. Invert Binary Tree

Description:

Invert a binary tree.

4
/ \
2 7
/ \ / \
1 3 6 9

to

4
/ \
7 2
/ \ / \
9 6 3 1

解题思路

递归算法：
1、交换根节点的左右子树。
2、对左右子树分别执行递归反转 。

代码

递归算法

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

非递归算法

TreeNode* invertTree(TreeNode* root) {  
        queue<TreeNode*> tree_queue;  
        if (root == NULL)  
            return root;  
        tree_queue.push(root);  
        while(tree_queue.size() > 0){  
            TreeNode * pNode = tree_queue.front();  
            tree_queue.pop();  
            TreeNode * pLeft = pNode->left;  
            pNode->left = pNode->right;  
            pNode->right = pLeft;  
            if (pNode->left)  
                tree_queue.push(pNode->left);  
            if (pNode->right)  
                tree_queue.push(pNode->right);  
        }  
        return root;  
    }