Leetcode/028_inorderTraversal.py at master · TheSarang/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
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

# Recursive

class Solution:
    def __init__(self):
        self.list1 = []

    def inorderTraversal(self, root: TreeNode) -> List[int]:
        if root == None:
            return
        self.inorderTraversal(root.left)
        self.list1.append(root.val)
        self.inorderTraversal(root.right)
        return self.list1

# Iterative

class Solution:
    def __init__(self):
        self.list1 = []

    def inorderTraversal(self, root: TreeNode) -> List[int]:
        stack = []
        ans = []
        cur = root
        while True:
          if cur != None:
            stack.append(cur)
            cur = cur.left
          elif stack:
            cur = stack.pop()
            ans.append(cur.val)
            cur = cur.right
          else:
            break
        return ans