10 examples of 'inorder traversal python' in Python

37
def inorder(self):
38
    self._inorder_recursive(self.head)

22
def _traversal(self, node, res):
23
    if not node:
24
        return
25
26
    self._traversal(node.left, res)
27
    res.append(node.val)
28
    self._traversal(node.right, res)

2
def postorderTraversal(self, root):
3
    if root is None:
4
        return []
5
    return (
6
        self.postorderTraversal(root.left)
7
        + self.postorderTraversal(root.right)
8
        + [root.val]
9
    )

40
def helper(root):
41
    if root:
42
        helper(root.left)
43
        vals.append(root.val)
44
        helper(root.right)

30
def preorder(self):
31
    print(self.key)
32
    if self.leftChild:
33
        self.leftChild.preorder()
34
    if self.rightChild:
35
        self.rightChild.preorder()

297
def inorder_traverse(self):
298
299
    result = []
300
301
    if not self.root:
302
        return result
303
304
    result.extend(self.root.left.inorder_traverse())
305
    result.append(self.root.contents)
306
    result.extend(self.root.right.inorder_traverse())
307
308
    return result

64
def _print_in_order_traversal(self, x):
65
    if x is not None:
66
        self._print_in_order_traversal(x.left)
67
        print(x.key, "-> ", end="")
68
        self._print_in_order_traversal(x.right)

46
def recursive_inorder(self, root, ans):
47
    if not root:
48
        return
49
50
    self.recursive_inorder(root.left, ans)
51
    ans.append(root.val)
52
    self.recursive_inorder(root.right, ans)

30
@staticmethod
31
def postorderTraversal(root, result = []):
32
    result = []
33
34
    def helper(root, result):
35
        if not root:
36
            return
37
        helper(root.left, result)
38
        helper(root.right, result)
39
        result.append(root.val)
40
41
    helper(root, result)
42
    return result

10
def inorderTraversal(self, root):
11
    """
12
    :type root: TreeNode
13
    :rtype: List[int]
14
    """
15
    stack = []
16
    result = []
17
    while root or stack:
18
        if root:
19
            stack.append(root)
20
            root = root.left
21
        else:
22
            node = stack.pop()
23
            result.append(node.val)
24
            root = node.right
25
    return result