Invert a binary tree.
Example:
Input:
4 / \ 2 7 / \ / \ 1 3 6 9
Output:
4 / \ 7 2 / \ / \ 9 6 3 1
Trivia:
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 f*** 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:
void dfs(TreeNode* root){
if(root->left) dfs(root->left);
if(root->right) dfs(root->right);
TreeNode* tmp=root->right;
root->right=root->left;
root->left=tmp;
}
TreeNode* invertTree(TreeNode* root) {
if(!root) return NULL;
dfs(root);
return root;
}
};