【搜索和回溯】剑指 Offer 27. 二叉树的镜像

题目描述：请完成一个函数，输入一个二叉树，该函数输出它的镜像。

示例：输入：root = [4,2,7,1,3,6,9]
输出：[4,7,2,9,6,3,1]

题解1：根据二叉树镜像的定义就是交换左子树和右子树，运用DFS遍历(先序遍历）二叉树，交换每个节点的左 / 右子节点，即可生成二叉树的镜像。

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def mirrorTree(self, root: TreeNode) -> TreeNode:
        if not root:
            return
        tmp = root.left
        root.left = self.mirrorTree(root.right)
        root.right = self.mirrorTree(tmp)
        return root

题解2：
利用辅助栈（或队列），按照层序，遍历树的所有节点node，并交换每个node的左/右子节点。

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def mirrorTree(self, root: TreeNode) -> TreeNode:
        if not root: return None
        stack = [root]
        while stack:
            node = stack.pop()
            if node.left:stack.append(node.left)
            if node.right:stack.append(node.right)
            node.left, node.right = node.right, node.left
        return root