Merge pull request #480 from Shivam2498/master

Create tree traversel in c

Author: probot-auto-merge[bot]

C/treetraversel.c

@@ -0,0 +1,86 @@
+#include <stdio.h> 
+#include <stdlib.h> 
+
+struct node 
+{ 
+	int data; 
+	struct node* left; 
+	struct node* right; 
+}; 
+
+struct node* newNode(int data) 
+{ 
+	struct node* node = (struct node*) 
+								malloc(sizeof(struct node)); 
+	node->data = data; 
+	node->left = NULL; 
+	node->right = NULL; 
+
+	return(node); 
+} 
+
+void printPostorder(struct node* node) 
+{ 
+	if (node == NULL) 
+		return; 
+
+	printPostorder(node->left); 
+
+	printPostorder(node->right); 
+
+	printf("%d ", node->data); 
+} 
+
+/* Given a binary tree, print its nodes in inorder*/
+void printInorder(struct node* node) 
+{ 
+	if (node == NULL) 
+		return; 
+
+	/* first recur on left child */
+	printInorder(node->left); 
+
+	/* then print the data of node */
+	printf("%d ", node->data); 
+
+	/* now recur on right child */
+	printInorder(node->right); 
+} 
+
+/* Given a binary tree, print its nodes in preorder*/
+void printPreorder(struct node* node) 
+{ 
+	if (node == NULL) 
+		return; 
+
+	/* first print data of node */
+	printf("%d ", node->data); 
+
+	/* then recur on left sutree */
+	printPreorder(node->left); 
+
+	/* now recur on right subtree */
+	printPreorder(node->right); 
+}	 
+
+/* Driver program to test above functions*/
+int main() 
+{ 
+	struct node *root = newNode(1); 
+	root->left			 = newNode(2); 
+	root->right		 = newNode(3); 
+	root->left->left	 = newNode(4); 
+	root->left->right = newNode(5); 
+
+	printf("\nPreorder traversal of binary tree is \n"); 
+	printPreorder(root); 
+
+	printf("\nInorder traversal of binary tree is \n"); 
+	printInorder(root); 
+
+	printf("\nPostorder traversal of binary tree is \n"); 
+	printPostorder(root); 
+
+	getchar(); 
+	return 0; 
+}