InorderTraversal.py

# Tree representation
class Node:
    def __init__(self, val):
        self.data = val
        self.right = None
        self.left = None

def recursive_inorder(node):
    if not node:
        return

    recursive_inorder(node.left)
    print(node.data, end = " ")
    recursive_inorder(node.right)

def non_recursive_inorder(node):
    stack = []
    current = node
    done = 0

    while not done:
        if current is not None:
            stack.append(current)
            current = current.left

        else:
            if len(stack) > 0:
                current = stack.pop()
                print(current.data, end = ' ')

                current = current.right

            else:
                done = 1

# Test
if __name__ == '__main__':
    a = Node(2)
    b = Node(1)
    c = Node(3)

    a.left = b
    a.right = c

    recursive_inorder(a)
    print()
    non_recursive_inorder(a)
    print()