tree traversal inorder,preorder,postorder,levelorder

Author: keshavsingh3197

HackerRank/Data Structure/Tree/Traversal/inorder.py

@@ -0,0 +1,5 @@
+def display(head):
+    if head:
+        display(head.left)
+        print(head.data)
+        display(head.right)

HackerRank/Data Structure/Tree/Traversal/levelorder.py

@@ -0,0 +1,10 @@
+# https://www.hackerrank.com/challenges/tree-level-order-traversal/problem
+def levelOrder(root):
+    queue=[root]
+    while queue:
+        print(queue[0].data,end=' ')
+        if queue[0].left:
+            queue.append(queue[0].left)
+        if queue[0].right:
+            queue.append(queue[0].right)
+        queue.pop(0)

HackerRank/Data Structure/Tree/Traversal/postorder.py

@@ -0,0 +1,5 @@
+def postorder(head):
+    if head:
+        display(head.left)
+        display(head.right)
+        print(head.data)

HackerRank/Data Structure/Tree/Traversal/preorder.py

@@ -0,0 +1,5 @@
+def preorder(head):
+    if head:
+        print(head.data)
+        display(head.left)
+        display(head.right)