# 方式1：生成新的鏡像二叉樹def getMirrorBST(self, root):  if root == None:    return  newTree = treeNode(root.val)  newTree.right = self.getMirrorBST(root.left)  newTree.left = self.getMirrorBST(root.right)  return newTree

# 方式2：改變給定的二叉樹為鏡像二叉樹def turnToMirror(self, root):  if root == None:    return  root.right, root.left = root.left, root.right  self.turnToMirror(root.left)  self.turnToMirror(root.right)  return root

class Solution:  # 給定一個(gè)二叉樹，獲得其鏡像（軸對(duì)稱）的鏡像二叉樹：  # 方式1：生成新的鏡像二叉樹  def getMirrorBST(self, root):    if root == None:      return    newTree = treeNode(root.val)    newTree.right = self.getMirrorBST(root.left)    newTree.left = self.getMirrorBST(root.right)    return newTree  # 方式2：改變給定的二叉樹為鏡像二叉樹  def turnToMirror(self, root):    if root == None:      return    root.right, root.left = root.left, root.right    self.turnToMirror(root.left)    self.turnToMirror(root.right)    return root  # 給定二叉樹的前序遍歷和中序遍歷，獲得該二叉樹  def getBSTwithPreTin(self, pre, tin):    if len(pre)==0 | len(tin)==0:      return None    root = treeNode(pre[0])    for order,item in enumerate(tin):      if root .val == item:        root.left = self.getBSTwithPreTin(pre[1:order+1], tin[:order])        root.right = self.getBSTwithPreTin(pre[order+1:], tin[order+1:])        return rootclass treeNode:  def __init__(self, x):    self.left = None    self.right = None    self.val = xif __name__ == '__main__':  flag = "turnToMirror"  solution = Solution()  preorder_seq = [1, 2, 4, 7, 3, 5, 6, 8]  middleorder_seq = [4, 7, 2, 1, 5, 3, 8, 6]  treeRoot1 = solution.getBSTwithPreTin(preorder_seq, middleorder_seq)  if flag == "mirrorBST":    newRoot = solution.getMirrorBST(treeRoot1)    print(newRoot)  if flag == "turnToMirror":    solution.turnToMirror(treeRoot1)    print(treeRoot1)