#include #include #include   struct  nodetype {           struct  nodetype  *left ;           int  info ;           struct  nodetype  *right;           }; typedef struct nodetype *NODEPTR;   NODEPTR maketree(int); NODEPTR getnode(void); void inordtrav(NODEPTR);   int main(void) {  NODEPTR root , p , q;   printf("%s\n","Enter First number");   scanf("%d",&number);   root=maketree(number); /* insert first root item */   while(scanf("%d",&number) !=EOF)   {  p=q=root;     /* find insertion point */     while((number !=p->info) && q!=NULL)      {p=q;        if (number info)                           q = p->left;                           else                           q = p->right;     }     q=maketree(number);     /* insertion */     if (number==p->info)                          printf("%d is a duplicate \n",number);                          else if (numberinfo)                                                              p->left=q;                                                  else  p->right=q;   }    printf("Tree Created \n ");    /* inorder Traversing  */    inordtrav(root);   }   NODEPTR maketree(int x) {  NODEPTR p;  p=getnode();  p->info=x;  p->left=NULL;p->right=NULL; /* printf("entered %d",p->info);  getchar(); */  return(p);  } void inordtrav(NODEPTR tree) {  if (tree != NULL) {                                                inordtrav(tree->left);                         printf("%d \n", tree->info);                         inordtrav(tree->right);                       }                 } NODEPTR getnode(void) {  NODEPTR q;  q = (NODEPTR) malloc(sizeof(struct nodetype));  return(q); }       Do some modifications to the program which will get data from an array structure defined below. Your program will generate the tree and display  the output person as descending order of name.     struct person {            int empNo;            char name[12];   }; struct person tenPerson[10]={123,”Mehmet”,                                                      234,”Sevgi”,                                                      128,”Osman”,                                                      432,”Mert”,                                                      287,”Ayse”,      423,”Kemal”,                                                      634,”Lale”,                                                      828,”Sefer”,                                                      252,”Meral”,                                                      887,”Demet”};

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%

#include<stdio.h>

#include<stdlib.h>

#include<conio.h>

 

struct  nodetype {

          struct  nodetype  *left ;

          int  info ;

          struct  nodetype  *right;

          };

typedef struct nodetype *NODEPTR;

 

NODEPTR maketree(int);

NODEPTR getnode(void);

void inordtrav(NODEPTR);

 

int main(void)

{

 NODEPTR root , p , q;

  printf("%s\n","Enter First number");

  scanf("%d",&number);

  root=maketree(number); /* insert first root item */

  while(scanf("%d",&number) !=EOF)

  {  p=q=root;

    /* find insertion point */

    while((number !=p->info) && q!=NULL)

     {p=q;

       if (number <p->info)

                          q = p->left;

                          else

                          q = p->right;

    }

    q=maketree(number);

    /* insertion */

    if (number==p->info)

                         printf("%d is a duplicate \n",number);

                         else if (number<p->info)

                                                             p->left=q;

                                                 else  p->right=q;

  }

   printf("Tree Created \n ");

   /* inorder Traversing  */

   inordtrav(root);

  }

 

NODEPTR maketree(int x)

{

 NODEPTR p;

 p=getnode();

 p->info=x;

 p->left=NULL;p->right=NULL;

/* printf("entered %d",p->info);

 getchar(); */

 return(p);

 }

void inordtrav(NODEPTR tree)

{

 if (tree != NULL) {

                      

                        inordtrav(tree->left);

                        printf("%d \n", tree->info);

                        inordtrav(tree->right);

                      }

               

}

NODEPTR getnode(void)

{

 NODEPTR q;

 q = (NODEPTR) malloc(sizeof(struct nodetype));

 return(q);

}

 

 

 

Do some modifications to the program which will get data from an array structure defined below.

Your program will generate the tree and display  the output person as descending order of name.

 

 

struct person

{

           int empNo;

           char name[12];

  };

struct person tenPerson[10]={123,”Mehmet”,

                                                     234,”Sevgi”,

                                                     128,”Osman”,

                                                     432,”Mert”,

                                                     287,”Ayse”,

     423,”Kemal”,

                                                     634,”Lale”,

                                                     828,”Sefer”,

                                                     252,”Meral”,

                                                     887,”Demet”};

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 4 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY