A)Draw the linked node structure created by the following program and , B)List the output of program. struct node{ struct node *left; char letter; struct node *right; }; typedef struct node *NODEPTR; NODEPTR getnode(void); void displayList(NODEPTR); void main() { NODEPTR p , list , save; char one; p=getnode(); p->letter='A'; list=p; p->right=p; p->left=p; save=list; for(int i=2;i<8;i+=2) { one='A'+ i; p=getnode(); p->letter=one; p->left=save; save->right=p; save=p; printf("Letter= %c\n",p->letter); } list->left=save; save->right=list; list=p; displayList(list); } void displayList(NODEPTR head) {NODEPTR save; printf("\nLIST\n"); save=head; do {printf("%c ",save->letter); save=save->left; }while(save!=head); } NODEPTR getnode() { NODEPTR q; q = (NODEPTR) malloc(sizeof(struct node)); return(q); }
A)Draw the linked node structure created by the following program and ,
B)List the output of program.
struct node{
struct node *left;
char letter;
struct node *right;
};
typedef struct node *NODEPTR;
NODEPTR getnode(void);
void displayList(NODEPTR);
void main()
{ NODEPTR p , list , save;
char one;
p=getnode();
p->letter='A';
list=p;
p->right=p;
p->left=p;
save=list;
for(int i=2;i<8;i+=2)
{
one='A'+ i;
p=getnode();
p->letter=one;
p->left=save;
save->right=p;
save=p;
printf("Letter= %c\n",p->letter);
}
list->left=save;
save->right=list;
list=p;
displayList(list);
}
void displayList(NODEPTR head)
{NODEPTR save;
printf("\nLIST\n");
save=head;
do
{printf("%c ",save->letter);
save=save->left;
}while(save!=head);
}
NODEPTR getnode()
{ NODEPTR q;
q = (NODEPTR) malloc(sizeof(struct node));
return(q);
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
