问题:https://leetcode.com/problems/invert-binary-tree/?tab=Description
Invert a binary tree.交换左右子树。
4
/ \
2 7
/ \ / \
1 3 6 9
to
4
/ \
7 2
/ \ / \
9 6 3 1
分析:递归交换左右子树。
参考C++代码:
/**
* 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(NULL==root) return NULL;
TreeNode* tem=root->left;
root->left=root->right;
root->right=tem;
invertTree(root->left);
invertTree(root->right);
return root;
}
};