Create two linked lists and then make a concatList(NODE **list1, NODE **list2) function that concatenates the two lists. The concatenated list must be a linked list. Fill in the "Write code here" sections appropriately.
Create two linked lists and then make a concatList(NODE **list1, NODE **list2) function that concatenates the two lists. The concatenated list must be a linked list. Fill in the "Write code here" sections appropriately.
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
Related questions
Question
Create two linked lists and then make a concatList(NODE **list1, NODE **list2) function that concatenates the two lists. The concatenated list must be a linked list. Fill in the "Write code here" sections appropriately.
![#include <stdio.h>
#include <stdlib.h
#include <tine.h>
typedef struct node (
int data;
struct node nextPtr;
}NODE;
int addElemant (NODE **head, int item){
/I Write code here
void printlist (NODE **head) {
/I Write code here
void concatlist(NODE **1ist1, NODE **list2)(
/I Write code here
int main(void)0
srand(20);/1Seed fix.
int num;
NDDE *list[2] - (NULL);
printf("How many elenenta? (8 - 188): ");
scanf("d", &num):
for(int ] - e; j < 2; j+)(
for(int 1 - 8; 1 < num; 1++)
addElenent (Elist[j), rand() S 180 + 1):
for(int 1- e; i « 2; 1++)(
printf("[List dl\n", 1):
printList(8list[1]):
concatlist (alist[@], alist[1]);
printf("[Concat]\n");
printList(klist[@]);
return e;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F300b1fc5-2fff-487f-af38-550515adf9e8%2Fb5fc0849-dc2d-4a08-886f-de1b8554ac8b%2Fluubgg_processed.png&w=3840&q=75)
Transcribed Image Text:#include <stdio.h>
#include <stdlib.h
#include <tine.h>
typedef struct node (
int data;
struct node nextPtr;
}NODE;
int addElemant (NODE **head, int item){
/I Write code here
void printlist (NODE **head) {
/I Write code here
void concatlist(NODE **1ist1, NODE **list2)(
/I Write code here
int main(void)0
srand(20);/1Seed fix.
int num;
NDDE *list[2] - (NULL);
printf("How many elenenta? (8 - 188): ");
scanf("d", &num):
for(int ] - e; j < 2; j+)(
for(int 1 - 8; 1 < num; 1++)
addElenent (Elist[j), rand() S 180 + 1):
for(int 1- e; i « 2; 1++)(
printf("[List dl\n", 1):
printList(8list[1]):
concatlist (alist[@], alist[1]);
printf("[Concat]\n");
printList(klist[@]);
return e;
![> How many elements? (0 ·
[List 0]
List is empty.
[List 1]
List is empty.
[Concat]
List is empty.
> How many elements? (0 - 100): 10
[List 0]
100): 0
12 59 98 60 97 82 63 42 41 82
[List 1]
51 25 48 10 45 10 66 8 80 60
[Concat]
12 59 98 60 97 82 63 42 41 82 51 25 48 10 45 10 66 8 80 60](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F300b1fc5-2fff-487f-af38-550515adf9e8%2Fb5fc0849-dc2d-4a08-886f-de1b8554ac8b%2Fylmg7i8_processed.png&w=3840&q=75)
Transcribed Image Text:> How many elements? (0 ·
[List 0]
List is empty.
[List 1]
List is empty.
[Concat]
List is empty.
> How many elements? (0 - 100): 10
[List 0]
100): 0
12 59 98 60 97 82 63 42 41 82
[List 1]
51 25 48 10 45 10 66 8 80 60
[Concat]
12 59 98 60 97 82 63 42 41 82 51 25 48 10 45 10 66 8 80 60
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education