Write a program where 2 linked lists have ben create and now the main task is to merge the linked lists and display the merged list. For example, merging lists {1, 2, 3} and {7, 13, 1} should yield {1, 7, 2, 13, 3, 1} Note: the above mentioned task is to be performed using doubly linked list and in C++

Write a program where 2 linked lists have ben create and now the main task is to merge the linked lists and display the merged list. For example, merging lists {1, 2, 3} and {7, 13, 1} should yield {1, 7, 2, 13, 3, 1} Note: the above mentioned task is to be performed using doubly linked list and in C++

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter13: Structures

Section13.4: Linked Lists

Problem 2E

See similar textbooks

Similar questions

Question : Write a c++ program which creates a Linked List having maximum sum out of two Sorted Linked Lists. Use this : LinkedList finalMaxSumList(LinkedList List1, LinkedList List2); For eg: You have two sorted linked lists, create a linked list that contains data with maximum sum. The resulting list with maximum sum will contain nodes with data from both input sorted lists. While creating the resulting list with maximum sum, we may switch to the other input list only at the point of intersection (which mean the two nodes with the same value in the lists). You are only allowed to use O(1) extra space. Note: You have to returned Linked List which contain finalMaxSumList and you are not allowed to change in data type and prototype of the Function. Input:List1 = 1->3->30->90->120->240->511List2 = 0->3->12->32->90->125->240->249 Returned LinkedList: Following is resulting linked list out of two sorted listsResultingList =…
Write a program in c++ and make sure it works, that reads a list of students (first names only) from a file. It is possible for the names to be in unsorted order in the file but they have to be placed in sorted order within the linked list.The program should use a doubly linked list.Each node in the doubly linked list should have the student’s name, a pointer to the next student, and a pointer to the previous student. Here is a sample visual. The head points to the beginning of the list. The tail points to the end of the list. When inserting consider all the following conditions:if(!head){ //no other nodes}else if (strcmp(data, head->name)<0){ //smaller than head}else if (strcmp(data, tail->name)>0){ //larger than tail}else{ //somewhere in the middle} When deleting a student consider all the following conditions:student may be at the head, the tail or in the middleBelow, you will find a sample of what the file looks like. Notice the names are in…
Suppose you are given an unordered list LIST, write a C program which generatestwo lists List1 and List2, where List1 contains all the elements from LIST less thanKmin and List2 contains all the elements from LISTgreater thanKmax. Where, thevalues of ‘Kmin’ and ‘Kmax’ are provided by the user and ‘Kmin’ is always lessthan ‘Kmax’.
This is in C++. Given a ListItem class, complete main() using the built-in list type to create a linked list called shoppingList. The program should read items from input (ending with -1), adding each item to shoppingList, and output each item in shoppingList using the PrintNodeData() function. EX INPUT milk bread eggs waffles cereal -1 Ex OUTPUT milk bread eggs waffles cereal main.cpp #include "ListItem.h"#include <string>#include <list>#include <iostream> using namespace std; int main (int argc, char* argv[]) {// TODO: Declare a list called shoppingList of type ListItem string item; // TODO: Read inputs (items) and add them to the shoppingList list// Read inputs until a -1 is input // TODO: Print the shoppingList list using the PrintNodeData() function return 0;} ListItem.h (marked as read only) #ifndef LISTITEMH#define LISTITEMH #include <string> using namespace std; class ListItem {public:ListItem(); ListItem(string itemInit); // Print this nodevoid…
This is in c++ Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user-input value is the number of nodes in the linked list. Use the PrintNodeData() function to print the entire linked list. Don't print the dummy head node. Example input : 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 output: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 main.cpp: #include "MileageTrackerNode.h"#include <string>#include <iostream>using namespace std; int main (int argc, char* argv[]) {// References for MileageTrackerNode objectsMileageTrackerNode* headNode;MileageTrackerNode* currNode;MileageTrackerNode* lastNode; double miles;string date;int i; // Front of nodes listheadNode = new MileageTrackerNode();lastNode = headNode; // TODO: Read in the number of nodes // TODO: For the read in number of nodes, read// in data and insert into the linked list // TODO: Call the PrintNodeData() method// to print the entire linked list //…
This is in c++ Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user-input value is the number of nodes in the linked list. Use the PrintNodeData() function to print the entire linked list. Don't print the dummy head node. Example input : 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 output: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 main.cpp: #include "MileageTrackerNode.h"#include <string>#include <iostream>using namespace std; int main (int argc, char* argv[]) {// References for MileageTrackerNode objectsMileageTrackerNode* headNode;MileageTrackerNode* currNode;MileageTrackerNode* lastNode; double miles;string date;int i; // Front of nodes listheadNode = new MileageTrackerNode();lastNode = headNode; // TODO: Read in the number of nodes // TODO: For the read in number of nodes, read// in data and insert into the linked list // TODO: Call the PrintNodeData() method// to print the entire linked list //…
Suppose we have a singly linked list implemented with the structure below and a function that takes in the head of the list.typedef struct node{int num;struct node* next;} node;int whatDoesItDo (node * head){struct node * current = head;struct node * other, *temp;if (current == NULL)return head;other = current->next;if (other == NULL)return head;other = other->next;temp = current->next;current->next = other->next;current = other->next;if (current == NULL){head->next = temp;return head;}other->next = current->next;current->next = temp;return head;}If we call whatDoesItDo(head) on the following list, show the list after the function has finished.head -> 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7
Question : Write a c++ program which creates a Linked List having maximum sum out of two Sorted Linked Lists.For eg: You have two sorted linked lists, create a linked list that contains data with maximum sum. The resulting list with maximum sum will contain nodes with data from both input sorted lists. While creating the resulting list with maximum sum, we may switch to the other input list only at the point of intersection (which mean the two nodes with the same value in the lists). You are only allowed to use O(1) extra space. Input:List1 = 1->3->30->90->120->240->511List2 = 0->3->12->32->90->125->240->249 Output: Following is resulting linked list out of two sorted listsResultingList = 1->3->12->32->90->125->240->511
Write a program in C that performs the following tasks: Store the information about books in the library using a linked list structure. Each book should have the following information: book name, author name, ISBN, and publication year. Allow the user to add a new book to the linked list. Allow the user to delete a book from the linked list based on ISBN. Allow the user to search for a book in the linked list based on book name, author name, ISBN or publication year. Display the list of all books in the library. Note: The program should use the linked list implementation for storing the books and should not use any built-in library functions for linked lists.
This is a c++ programming question so do exactly what the question says and follow the pattern in the image that I gave just follow the pattern and implement all the functions as single linked list Question - (Implement all the functions as like singly linked list) See the picture
Write a program in haskell programming language to subtract 10 from all list elements without using any loop. Use map and fmap And assume two different lists
write a c++ program that implements a doubly linked list. The data must be read from the files and you can put the file names in your program. Letters.txt contains 26 English Letters: A B C D ... Z Sequence.txt contains a list of numbers. 3,-3,19,-19,18,1,-2,3,-18,17,1,-3,-13,14 You need to 1. Create a doubly linked list by reading the 26 letters from Letters.txt. 2. Sequence.txt file contains a sequence of relative letter positions. The initial position is at the beginning of the list which is ‘A’. The first number in the sequence is ‘3’. So the current position will move forward for three steps. Then the first letter to output is ‘D’ and now the current position is at ‘D’ as well. The second number in the sequence is ‘-3’. Then the second letter to output is the third element backward from the current position which is ‘A’. You need to output all letters indicated in sequence.txt Your need to 1. Create a doubly linked list 2. Implement putItem() method and use this method to create…