Merge pull request #56 from ashish-ratn/ashish-ratn-patch-3

Created recursive traversal for binary trees

Author: ashish-ratn

Recursive_Traversals.c

@@ -0,0 +1,40 @@
+#include <stdio.h>
+
+void inOrderTraversal(struct node *node)
+{
+    if (node == NULL)  // if tree is empty
+        return;
+
+    inOrderTraversal(node->leftNode);
+    printf("\t%d\t", node->data);
+    inOrderTraversal(node->rightNode);
+}
+
+void preOrderTraversal(struct node *node)
+{
+    if (node == NULL)  // if tree is empty
+        return;
+
+    printf("\t%d\t", node->data);
+    preOrderTraversal(node->leftNode);
+    preOrderTraversal(node->rightNode);
+}
+
+void postOrderTraversal(struct node *node)
+{
+    if (node == NULL)  // if tree is empty
+        return;
+
+    postOrderTraversal(node->leftNode);
+    postOrderTraversal(node->rightNode);
+    printf("\t%d\t", node->data);
+}
+
+int main(void)
+{
+    /* traversals can be done by simply invoking the
+       function with a pointer to the root node.
+    */
+
+    return 0;
+}