Demonstrate inorder, preorder and post order traversal.

class Node:
    def __init__(self, key):
        self.left = self.right = None
        self.key = key
def inorder(node):   
    if node: inorder(node.left); print(node.key, end=" "); inorder(node.right)
def preorder(node):  
    if node: print(node.key, end=" "); preorder(node.left); preorder(node.right)
def postorder(node): 
    if node: postorder(node.left); postorder(node.right); print(node.key, end=" ")
root = Node(1)
root.left, root.right = Node(2), Node(3)
root.left.left, root.left.right = Node(4), Node(5)
print("Inorder:", end=" "); inorder(root); print()
print("Preorder:", end=" "); preorder(root); print()
print("Postorder:", end=" "); postorder(root); print()