题目来源【Leetcode】
Invert a binary tree.
4
/ \
2 7
/ \ / \
1 3 6 9
to
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) {}
* };
*/
void f(TreeNode*root){
if(root == NULL) return;
f(root->left);
f(root->right);
swap(root->left,root->right);
}
class Solution {
public:
TreeNode* invertTree(TreeNode* root) {
f(root);
return root;
}
};