PRACTICAL NO:-12 node* insertleft(node

#include<stdio.h> *root,int value)

#include<conio.h> {
typedef struct node root->left=createnode(value);
{ return root->left;
int data; }
struct node *left; node* insertright(node
struct node *right; *root,int value)
}node; {
void inorder(node *root) root->right=createnode(value);
{ return root->right;
if(root==NULL)return; }
inorder(root->left); int main()
printf("%d->",root->data); {
inorder(root->right); node *root=createnode(1);
} insertleft(root,12);
void preorder(node *root) insertright(root,9);
{ insertleft(root->left,5);
if(root==NULL)return; insertright(root->left,6);
printf("%d->",root->data); clrscr();
preorder(root->left); printf("inorder traversal\n");
preorder(root->right); inorder(root);
} printf("\npreorder
void postorder(node *root) traversal\n");
{ preorder(root);
if(root==NULL)return; printf("\npostorder
postorder(root->left); traversal\n");
postorder(root->right); postorder(root);
printf("%d->",root->data); getch();
} return 0;
node* createnode(value) }
{
node* newnode; OUTPUT OF THE CODE
inorder traversal
newnode=(node*)malloc(sizeof(nod 5->12->6->1->9->
e)); preorder traversal
newnode->data=value; 1->12->5->6->9->
newnode->left=NULL; postorder traversal
newnode->right=NULL; 5->6->12->9->1->
return newnode;
}