I need to create the functions for both union and merge Linked List.Note: Needs to be in C++. I'm using github. Merge Linked ListsAssume two input linked lists, LA and LB, whose elements are both in the non-descending order (duplicates mayexist). Implement the following function to merge LA and LB into a new linked list (as the return value). Theelements in the new list should still be in the non-descending order. The definition of the functionmergeLinked List is as the following:Linked List mergeLinked List (const LinkedList& LA, const Linked List& LB);For example, ifLA = (3, 5, 8, 11)LB = (2, 6, 8, 9, 22, 24)Then mergeLinkedList (LA, LB) = (2, 3, 5, 6, 8, 8, 9, 11, 22, 24). Note same values may repeat Union Linked ListsAssume two linked lists that represent Set A and Set B respectively. Implement the following function to obtaintheir union A U B and return the result as a new linked list. Note that a Set should not contain duplicate elements(e.g., integers), but its elements are not assumed to be sorted in the list. The definition of the functionunionLinkedList is as the following:Linked List unionLinked List (const Linked List& LA, const LinkedList& LB)For example, ifLA = (3, 5, 8, 11)LB = (2, 6, 8, 9, 22, 24)Then unionLinked List(LA, LB) = (3, 5, 8, 11, 2, 6, 9, 22, 24). Note the list isn't sorted. To compute theunion operation, you need to implement the Linked List search function to check whether a value is in the list ornot.

We have to create two functions: union and merge Linked List The description is already given in the…

Merge Linked Lists Assume two input linked lists, LA and LB, whose elements are both in the non-descending order (duplicates may exist). Implement the following function to merge LA and LB into a new linked list (as the return value). The elements in the new list should still be in the non-descending order. The definition of the function mergeLinked List is as the following: LinkedList mergeLinkedList (const LinkedList& LA, const LinkedList& LB); For example, if LA = (3, 5, 8, 11) LB = (2, 6, 8, 9, 22, 24) Then mergeLinked List (LA, LB) = (2, 3, 5, 6, 8, 8, 9, 11, 22, 24). Note same values may repeat

Merge Linked Lists Assume two input linked lists, LA and LB, whose elements are both in the non-descending order (duplicates may exist). Implement the following function to merge LA and LB into a new linked list (as the return value). The elements in the new list should still be in the non-descending order. The definition of the function mergeLinked List is as the following: LinkedList mergeLinkedList (const LinkedList& LA, const LinkedList& LB); For example, if LA = (3, 5, 8, 11) LB = (2, 6, 8, 9, 22, 24) Then mergeLinked List (LA, LB) = (2, 3, 5, 6, 8, 8, 9, 11, 22, 24). Note same values may repeat

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

Similar questions

write a c++ program to sort doubly linked list by swapping there links not the data.please don't use pointer to pointer or double pointer method.
Create a list in C++ and insert all lowercase alphabets in that list. Then using iterators print the list in reverse order with each element separated by space.
Write pseudocode and C++ code to search a given value in the linked list.
use Advanced C++ techniques, containers and features to refactor the C/C++ algorithm. The purpose is toreplace appropriate declarations and code segments with Advanced C++ declarations and code. * Replace all arrays with appropriate STL containers. * Use STL algorithms to REPLACE existing logic where appropriate. * Use smart and move pointers where pointers are needed. * Use lambda expressions where appropriate. * Use C++ style casting when needed. * Look for opportunities where tuples could be used. * The code listing is in C and C++. If there are logic or syntax problems, please fix. #define BIND(A,L,H) ((L)<(A)?(A)<(H)?(A):(H):(L)) char dih[50],dah[50],medium[30],word[30],*dd[2] = {dih,dah};const char *ascii = "ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789.,?'!/()&:;=+-_\"$@", *itu[] =…
need the solve and use C++ language plz
Write a merge function that takes pointers to two sorted lists as arguments and returns a pointer to a merged list in C++. Please explain with detailed. Thank you!
Create a C++ function template to alphabetize a user-specified data array?
Please provide a C++ function template that can be used to sort an array of various data types.
In c++ please.
Write C++ code to display all even numbers in the a doubly linked list pointed to by Dlist. Use while loop to scan all nodes from the start to the end. (Each node has three fields: a data field that contains the information, and right and left fields contain pointers to nodes on either side. Ex. p->left represents the address of the node to the left of node p) (any number of nodes in the linked list) Dlist 4 3 8 HIIN 7 1