题目:
Invert a binary tree.
4 / \ 2 7 / \ / \ 1 3 6 9to
4 / \ 7 2 / \ / \ 9 6 3 1Trivia:
This problem was inspired by this original tweet by Max Howell :
Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off.Google:我们90%的工程师使用你写的软件,但是你不能在白板上反转一个二叉树,所以滚蛋吧。(谷歌的HR好任性)
思路:
1、递归
2、迭代
代码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 NULL;
swap(root->left , root->right);
invertTree(root->left);
invertTree(root->right);
return root;
}
};
代码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 == NULL)
return NULL;
TreeNode *tmp = root->left;
root->left = invertTree(root->right);
root->right = invertTree(tmp);
return root;
}
};
代码3:
/**
* 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 NULL;
queue<TreeNode *> s;
s.push(root);
while(!s.empty())
{
TreeNode *node = s.front();
s.pop();
swap(node->left , node->right);
if(node->left)
s.push(node->left);
if(node->right)
s.push(node->right);
}
return root;
}
};
代码4:
/**
* 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 NULL;
stack<TreeNode *> s;
s.push(root);
while(!s.empty())
{
TreeNode *node = s.top();
s.pop();
swap(node->left , node->right);
if(node->left)
s.push(node->left);
if(node->right)
s.push(node->right);
}
return root;
}
};