p15 (Inorder, Preorder, Postorder)
p15 (Inorder, Preorder, Postorder)
Write a program to create binary search tree and perform inorder, preorder and
post order traversal. */
# include <stdio.h>
# include <stdio.h>
# include <conio.h>
# include <stdlib.h>
int data;
} node;
node *create_node() {
node *temp;
temp->lchild = NULL;
temp->rchild = NULL;
return temp;
if (root->lchild == NULL)
root->lchild = new_node;
else
insert(root->lchild, new_node);
if (root->rchild == NULL)
root->rchild = new_node;
else
insert(root->rchild, new_node);
inorder(temp->lchild);
printf("%3d", temp->data);
inorder(temp->rchild);
if (temp != NULL) {
printf("%3d", temp->data);
preorder(temp->lchild);
preorder(temp->rchild);
if (temp != NULL) {
postorder(temp->lchild);
postorder(temp->rchild);
printf("%3d", temp->data);
void main()
int n,i=1;
node *create_node();
root = NULL;
printf("enter no of elements\n");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
new_node = create_node();
scanf("%d", &new_node->data);
root = new_node;
else
insert(root, new_node);
inorder(root);
preorder(root);
postorder(root);
getch();
OUTPUT