Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Write a display function and delete function in the following code:    Declare the libraries   Declare the struct Node       void create (int A[], int n)     {        int i;        struct Node *t, *last;        first = (struct Node *)malloc(sizeof(struct Node));        first->data=A[0];        first->next=NULL;        last=first;               for(i=1;idata=A[i];            t->next=NULL;            last->next=t;            last=t;        }   } Write the Delete Function Write the display function     int main()   {       int A[]={10,20,30,40,50};       create(A,5);             Delete(first,4);             Display(first);       return 0;               }

Write a display function and delete function in the following code:    Declare the libraries   Declare the struct Node       void create (int A[], int n)     {        int i;        struct Node *t, *last;        first = (struct Node *)malloc(sizeof(struct Node));        first->data=A[0];        first->next=NULL;        last=first;               for(i=1;idata=A[i];            t->next=NULL;            last->next=t;            last=t;        }   } Write the Delete Function Write the display function     int main()   {       int A[]={10,20,30,40,50};       create(A,5);             Delete(first,4);             Display(first);       return 0;               }

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

Write a display function and delete function in the following code: 

 

  1. Declare the libraries

 

  1. Declare the struct Node

 

 

  void create (int A[], int n)

 

  {

       int i;

       struct Node *t, *last;

       first = (struct Node *)malloc(sizeof(struct Node));

       first->data=A[0];

       first->next=NULL;

       last=first;

      

       for(i=1;i<n;i++)

       {

           t=(struct Node *)malloc(sizeof(struct Node));

           t->data=A[i];

           t->next=NULL;

           last->next=t;

           last=t;

       }

  }

  1. Write the Delete Function
  2. Write the display function

 

  int main()

  {

      int A[]={10,20,30,40,50};

      create(A,5);

     

      Delete(first,4);

     

      Display(first);

      return 0;

     

     

  }

Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Linked List Representation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS