Postorder Tree Traversal.py

class Node:
    def __init__(self, data=None, left=None, right=None):
        self.data = data
        self.left = left
        self.right = right


def postorder(root):

    if root is None:
        return

    postorder(root.left)

    postorder(root.right)
    print(root.data, end=' ')


if __name__ == '__main__':


    root = Node(1)
    root.left = Node(2)
    root.right = Node(3)
    root.left.left = Node(4)
    root.right.left = Node(5)
    root.right.right = Node(6)
    root.right.left.left = Node(7)
    root.right.left.right = Node(8)

    postorder(root)