Question

c program that takes a seridalized text file of a tree of up to 32 nodes and builds its stick diagram as shown.

Example 1: Input text file: 10 6 1@5@@8@@ 12 @ 13 @ 20 19 16 @@@@ Output text file: 10 / 12 6 / 1 - 8 13 - - 5 20 19 - 16

Answer 1

#include <stdio.h>
#include <stdlib.h>

#include<conio.h>

struct btnode
{
int value;
struct btnode *l;
struct btnode *r;
}*root = NULL, *temp = NULL, *t2, *t1;

void insert();
void create();
void display(struct btnode *t);
void search(struct btnode *t);

int flag = 1;

void main()
{
int ch;

printf("\nOPERATIONS ---");
printf("\n1 - Insert an element into tree\n");
printf("2 - display Traversal\n");
  printf("3 - Exit\n");
while(1)
{
printf("\nEnter your choice : ");
scanf("%d", &ch);
switch (ch)
{
case 1:
insert();
break;
case 2:
dislay(root);
break;
case 3:
exit(0);
default :   
printf("Wrong choice, Please enter correct choice ");
break;
}
}
}

/* This is to insert into node */
void insert()
{
create();
if (root == NULL)
root = temp;
else
search(root);
}

/* creation  of  node */
void create()
{
int data;

printf("Enter data of node to be inserted : ");
scanf("%d", &data);
temp = (struct btnode *)malloc(1*sizeof(struct btnode));
temp->value = data;
temp->l = temp->r = NULL;
  
}

void search(struct btnode *t)
{
if ((temp->value > t->value) && (t->r != NULL)) /* value more than root node value insert at right */
search(t->r);
else if ((temp->value > t->value) && (t->r == NULL))
t->r = temp;
else if ((temp->value < t->value) && (t->l != NULL)) /* value less than root node value insert at left */
search(t->l);
else if ((temp->value < t->value) && (t->l == NULL))
t->l = temp;
}

/* to display traversal */
void display(struct btnode *t)
{
if (root == NULL)
{
printf("No elements in a tree to display");
return;
}
if (t->l != NULL)
display(t->l);
printf("%d -> ", t->value);
if (t->r != NULL)
display(t->r);
}