题目:
思路+实现:
class Solution:
def mirrorTree(self, root: TreeNode) -> TreeNode:
# 递归思路:二叉树的镜像,无非就是交换左右子树就行;这里采用递归的方法,每次先存储左节点,传入右节点递归,递归赋值给左节点;
# 从最后一个右叶子节点完成后,开始从往上,进行左子树的递归;
if not root:
return
# temp = root.left
# root.left = self.mirrorTree(root.right)
# root.right = self.mirrorTree(temp)
root.left, root.right = self.mirrorTree(root.right), self.mirrorTree(root.left)
return root