tree traversing pre/post/in-order

Singhak · web-flow · commit ce642f10e232 · 2018-03-27T12:31:51.000+05:30
diff --git a/treeTraversal.py b/treeTraversal.py
@@ -0,0 +1,37 @@
+class Node:
+	def __init__(self, value):
+		self.left = None
+		self.right = None
+		self.val = value
+	
+def preorder(root):
+	if isinstance(root, Node):
+		print(root.val),
+		preorder(root.left)
+		preorder(root.right)
+		
+def postorder(root):
+	if isinstance(root, Node):
+		preorder(root.left)
+		preorder(root.right)
+		print(root.val)
+		
+def inoderorder(root):
+	if isinstance(root, Node):
+		preorder(root.left)
+		print(root.val)
+		preorder(root.right)
+		
+		
+		
+root = Node(1)
+root.left      = Node(2)
+root.right     = Node(3)
+root.left.left  = Node(4)
+root.left.right  = Node(5)
+print( "Preorder traversal of binary tree is")
+preorder(root)
+print( "Postorder traversal of binary tree is")
+postorder(root)
+print( "Inoder traversal of binary tree is")
+inoderorder(root)
