Question

Write a C program to build a complete binary tree with 7 nodes using link list implementation.

Requirements:

1) Ask the user to enter randomly seven integer numbers as data value for each node

2) Build the tree using link list

3) Print the tree in inorder , preorder , and post order

4) Use functions for each print type .

Answer 1

#include<stdio.h>
#include<malloc.h>
struct node
{
int info;
struct node *left,*right;
};
struct node *root=NULL;
void insert(struct node *,int num);
void rec_pre(struct node *);
void rec_in(struct node *);
void rec_post(struct node *);
void main()
{
int cnt=7,i;
int no[7];
system("cls");
printf("\nEnter the values:\t");
for(i=0;i<cnt;i++)
scanf("%d",&no[i]);  
for(i=0;i<cnt;i++)   
insert(root,no[i]);
printf("\nIn Preorder\t:");
rec_pre(root); // function to print in preorder
printf("\nIn Inorder\t:");
rec_in(root); // function to print in inorder
printf("\nIn Postorder\t:");
rec_post(root); // function to print in postorder
}
void rec_pre(struct node *ptr)
{
if(ptr!=NULL)
{
printf("%d\t",ptr->info);
rec_pre(ptr->left);
rec_pre(ptr->right);
}
else
return;
}
void rec_in(struct node *ptr)
{
if(ptr!=NULL)
{
rec_in(ptr->left);
printf("%d\t",ptr->info);
rec_in(ptr->right);
}
else
return;
}
void rec_post(struct node *ptr)
{
if(ptr!=NULL)
{
rec_post(ptr->left);
rec_post(ptr->right);
printf("%d\t",ptr->info);
}
else
return;
}
void insert(struct node *ptr,int num)
{
struct node *temp,*parent;
temp=(struct node *)malloc(sizeof(struct node));
temp->info=num;
temp->left=NULL;
temp->right=NULL;
if(ptr==NULL) // if initially tree has no node i.e. tree is empty
root=temp;
else
{
while(ptr!=NULL) // finding the next empty position
{
parent=ptr;
if(num<ptr->info)
ptr=ptr->left;
else
ptr=ptr->right;
}
if(num<parent->info)
parent->left=temp;
else
parent->right=temp;
}
}
$EARimjhim)question.c Dev-C+5.11 File Edit Search View Project Execute Tools AStyle WindowHelp Project Classes Debug ree.c question.c include<stdio.h> #includecna lloc. h> 1 3 struct node int info; struct node left, right struct node root-NULL3 9 void insert(struct node ,int num)3 18 void rec _pre(struct node *); 11 void rec in(struct node )j 12 void rec_post (struct node )j 13 void main() 14 15 16 17 18 19 20 21 int cnt-7,ij int nol7]j system(cls)5 printf(nEnter the values:\t); for(i-8ji<cntji++) scanf(%d,&no[i]); for(i-8;i<cnti++) insert (root, no[i]); 23 24 25 26 27 28 printf(nIn Preorder\t:) rec pre(root)i printf(AnIn Inorderlt: rec in(root); printf(nIn Postorder\t:) rec post (root)i I function to print in preorder // function to print in tnorder /7 function to print in postorder 83 Compiler-Resources dh compile Log e Debug鳳Find Results Close Compilation results.. -Errors: 0 -Warnings: 0 Activate Windows Go to Settings to activate Windows □Shorten compiler paths |-Output Filename: E:\Rinj himlquestion.exe Line: Col: 36 Sel: 0 Lines: 88 Length: 1877 Done parsing in 0.031 seconds O Type here to search 12:29 PM ea dx 11/20/2018 ^ D$ OUTPUT SCREENSHOT: