题目
翻转一棵二叉树。
示例
输入:
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 == nullptr ) return nullptr;
TreeNode* temp = root->left;
root->left = root->right;
root->right = temp;
invertTree( root->left );
invertTree( root->right );
return root;
}
};