题目 -> LC226. 翻转二叉树

解题思路

代码

Python

1
2
3
4
5
6
7
class Solution:
    def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
        if root is None: return TreeNode().left
        self.invertTree(root.left)
        self.invertTree(root.right)
        root.left, root.right = root.right, root.left
        return root

C++

1
2
3
4
5
6
7
8
9
10
11
12
class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        if (root == NULL) return root;
        invertTree(root->left);
        invertTree(root->right);
        TreeNode* node = root->right;
        root->right = root->left;
        root->left = node;
        return root;
    }
};