翻转一棵二叉树。
示例:
输入:
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 NULL;
invert(root);
return root;
}
void invert(TreeNode* root){
if(root->left==NULL && root->right==NULL)
return;
swap(root->left,root->right);
if(root->left!=NULL)
invert(root->left);
if(root->right!=NULL)
invert(root->right);
}
};