題目:
思路+實現:
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