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.
/**
* 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)
{
queue<TreeNode*> q;
if(root == NULL)
return root;
q.push(root);
while(!q.empty())
{
TreeNode *node = q.front();
q.pop();
TreeNode *tmpLeft = node->left;
node->left = node->right;
node->right = tmpLeft;
if(node->left)
q.push(node->left);
if(node->right)
q.push(node->right);
}
return root;
}
};