BinaryTree.py

class Node:
  def __init__(self,key):
    self.left=None
    self.right = None
    self.val = key
#Traverse preorder 

def traversePreOrder(self):
  print(self.val,end='')
  if self.left:
    self.left.traversePreorder()
  if self.right:
    self.right.traversePreOrder()
 
#Traverse Order

def traverseInorder(self):
  if self.left:
    self.left.traverseInorder()
  print(self.val,end='')
  if self.right:
    self.right.traverseInorder()

#Traverse postorder

def traversePostOrder(self):
  if self.left:
    self.left.traversePostOrder()
  if self.right:
    self.right.traversePostOrder()
  print(self.val,end='')
  
root = Node(1)
root.left = Node(2)
root.right = Node(3)
root.left.left = Node(4)
print('Pre Order Traversal',end = '')
root.traversalPreOrder()
print('\n Inorder Traversal:',end='')
root.traverseInorder()
print('\n Post order Traversal',end='')
root.traversePostOrder()