Python刷leetcode--剑指 Offer 27. 二叉树的镜像（附带树的几种遍历方式）

• 思路：递归的交换左右子树
• 推出条件：左右子树都为None
• 难点：特殊情况如何处理
  

class Solution:
    def mirrorTree(self, root: TreeNode) -> TreeNode:
        if not root:
            return None
        return self.recur(root)

    def recur(self, root: TreeNode) -> TreeNode:
        # leetcode submit region end(Prohibit modification and deletion)
        if not root.left and not root.right:
            return root
        if not root.left:
            root.left = root.right
            root.right = None
            self.recur(root.left)
            return root
        elif not root.right:
            root.right = root.left
            root.left = None
            self.recur(root.right)
            return root

        root.left, root.right = root.right, root.left
        self.recur(root.left)
        self.recur(root.right)
        return root

前序遍历、层次遍历(用来验证结果)

    # 层次遍历
    def printTree(self, root):
        my_seq = Queue()
        my_seq.put(root)
        while my_seq.qsize():
            tmpNode = my_seq.get()
            print(tmpNode.val)
            if tmpNode.left:
                my_seq.put(tmpNode.left)
            if tmpNode.right:
                my_seq.put(tmpNode.right)    
    

    # 咋就写成中序遍历了。。。
    def printTree(self, root):
        if not root:
            return
    #   print(root.val)        先根遍历
        self.printTree(root.left)
        print(root.val)
        self.printTree(root.right)
	#   print(root.val)        后根遍历        

完整代码

from queue import Queue


# leetcode submit region begin(Prohibit modification and deletion)
# 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
        return self.recur(root)

    def recur(self, root: TreeNode) -> TreeNode:
        # leetcode submit region end(Prohibit modification and deletion)
        if not root.left and not root.right:
            return root
        if not root.left:
            root.left = root.right
            root.right = None
            self.recur(root.left)
            return root
        elif not root.right:
            root.right = root.left
            root.left = None
            self.recur(root.right)
            return root

        root.left, root.right = root.right, root.left
        self.recur(root.left)
        self.recur(root.right)
        return root

    def printTree(self, root):
        if not root:
            return None
        my_seq = Queue()
        my_seq.put(root)
        while my_seq.qsize():
            tmpNode = my_seq.get()
            print(tmpNode.val)
            if tmpNode.left:
                my_seq.put(tmpNode.left)
            if tmpNode.right:
                my_seq.put(tmpNode.right)


if __name__ == '__main__':
    sol = Solution()
    root = [4, 2, 7, 1, 3, 6, 9]
    # 测试用例：test1
    # my_test, my_test.left, my_test.right = TreeNode(4), TreeNode(2), TreeNode(7)
    # my_test.left.left, my_test.left.right = TreeNode(1), TreeNode(3)
    # my_test.right.left, my_test.right.right = TreeNode(6), TreeNode(9)

    # 测试用例：test2
    my_test, my_test.left, my_test.left.left = TreeNode(4), TreeNode(2), TreeNode(7)

    # 测试用例: test3
    # ans = sol.mirrorTree(None)

    ans = sol.mirrorTree(my_test)
    sol.printTree(ans)