Merge pull request codehouseindia#501 from Bhanu-cyber/patch-1

codehouseindia · web-flow · commit 101dcc5df570 · 2020-10-11T13:04:14.000+05:30
Create Tree Traversal - inorder, preorder and postorder
diff --git a/Tree Traversal - inorder, preorder and postorder b/Tree Traversal - inorder, preorder and postorder
@@ -0,0 +1,65 @@
+# Tree traversal in Python
+
+
+class Node:
+    def __init__(self, item):
+        self.left = None
+        self.right = None
+        self.val = item
+
+
+def inorder(root):
+
+    if root:
+        # Traverse left
+        inorder(root.left)
+        # Traverse root
+        print(str(root.val) + "->", end='')
+        # Traverse right
+        inorder(root.right)
+
+
+def postorder(root):
+
+    if root:
+        # Traverse left
+        postorder(root.left)
+        # Traverse right
+        postorder(root.right)
+        # Traverse root
+        print(str(root.val) + "->", end='')
+
+
+def preorder(root):
+
+    if root:
+        # Traverse root
+        print(str(root.val) + "->", end='')
+        # Traverse left
+        preorder(root.left)
+        # Traverse right
+        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("Inorder traversal ")
+inorder(root)
+
+print("\nPreorder traversal ")
+preorder(root)
+
+print("\nPostorder traversal ")
+postorder(root)
+Previous Tutorial:
+Tree Data Structure
+Next Tutorial:
+Binary Tree
+Share on:
+ 
+Was this article helpful?
+
