leetcode/Python/invert-binary-tree.py at master · OnlyChristmas/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
'''

Invert a binary tree.

Example:

Input:

     4
   /   \
  2     7
 / \   / \
1   3 6   9
Output:

     4
   /   \
  7     2
 / \   / \
9   6 3   1
Trivia:
This problem was inspired by this original tweet by Max Howell:

Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so f*** off.


'''


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

class Solution:
    def invertTree(self, root: TreeNode) -> TreeNode:

        # Approach one  递归求解
        # if not root : return None
        # root.right , root.left = self.invertTree(root.left), self.invertTree(root.right)
        # return root


        # Approach two  栈+循环
        # if not root : return None
        # stack = [root]
        # while stack:
        #     node = stack.pop()
        #     node.left , node.right = node.right , node.left
        #     if node.left : stack.append(node.left)
        #     if node.right: stack.append(node.right)
        # return root

        # Approach three  队列也是一样
        if not root : return None
        q = [root]
        while q:
            node = q.pop()
            node.left , node.right = node.right , node.left
            if node.left : q.append(node.left)
            if node.right: q.append(node.right)
        return root