tree_trv.c

tree_trv.c

@@ -0,0 +1,57 @@
+#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); 
+} 
+void printinorder(struct node* node) 
+{ 
+	if (node == NULL) 
+		return; 
+	printinorder(node->left); 
+	printf("%d ", node->data); 
+	printinorder(node->right); 
+} 
+void printpreorder(struct node* node) 
+{ 
+	if (node == NULL) 
+		return; 
+	printf("%d ", node->data); 
+	printpreorder(node->left); 
+	printpreorder(node->right); 
+}	 
+int main() 
+{ 
+	struct node *root = newnode(8); 
+	root->left=newnode(65); 
+	root->right=newnode(25); 
+	root->left->left=newnode(41); 
+	root->left->right=newnode(51);
+	root->right->left=newnode(-51);
+	root->right->left->left=newnode(85);
+	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); 
+	return 0; 
+}