Use C++ Write a function that takes two call-by-reference arguments that arepointer variables that point to the heads of linked lists of values of typeint. The two linked lists are assumed to be sorted so that the number atthe head is the smallest number, the number in the next node is the nextsmallest, and so forth. The function returns a pointer to the head of a newlinked list that contains all of the nodes in the original two lists. Sample output 1Enter number of elements in first linkedlist: 3Enter the 1 element of first linkedlist: 1Enter the 2 element of first linkedlist: 5Enter the 3 element of first linkedlist: 10Sample output 2Enter number of elements in first linkedlist: 5Enter the 1 element of first linkedlist: 3Enter the 2 element of first linkedlist: 7Enter the 3 element of first linkedlist: 8Enter the 4 element of first linkedlist: 12Enter number of elements in second linkedlist: 5 Enter the 5 element of first linkedlist: 16Enter the 1 element of second linkedlist: 2Enter the 2 element of secondEnter the 3 element of secondEnter the 4 element of secondEnter the 5 element of second linkedlist: 12linkedlist: 3linkedlist: 4linkedlist: 8The first linked list is shown as:1->5->10->NULLThe second linked list is shown as:2-3-4->8->12->NULLMerged Linked List is:1-2-3-4-5->8->10->12->NULLEnter number of elements in second linkedlist: 7Enter the 1 element of second linkedlist: 1Enter the 2 element of second linkedlist: 4Enter the 3 element of second linkedlist: 5Enter the 4 element of second linkedlist: 10Enter the 5 element of second linkedlist: 11Enter the 6 element of second linkedlist: 12Enter the 7 element of second linkedlist: 20The first linked list is shown as:3->7->8->12->16-> NULLThe second linked list is shown as:1-4->5->10->11->12->20-> NULLMerged Linked List is:1->3->4->5->7->8->10->11->12->12->16->20-> NULL

Given To know about the Linked list in C++ programing . merge two sorted linked list.

Write a function that takes two call-by-reference arguments that are pointer variables that point to the heads of linked lists of values of type int. The two linked lists are assumed to be sorted so that the number at the head is the smallest number, the number in the next node is the next smallest, and so forth. The function returns a pointer to the head of a new linked list that contains all of the nodes in the original two lists.

Write a function that takes two call-by-reference arguments that are pointer variables that point to the heads of linked lists of values of type int. The two linked lists are assumed to be sorted so that the number at the head is the smallest number, the number in the next node is the next smallest, and so forth. The function returns a pointer to the head of a new linked list that contains all of the nodes in the original two lists.

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 void function that takes a linked list of integers and removes all the duplicate elements from the list. The function will have one call-by-reference parameter that is a pointer to the head of the list. After the function is called, this pointer will point to the head of a linked list that has the nodes that have all the distinct integers. Place your function in a suitable test program.
Write a function that has two linked-list head pointers as parameters. Assume that the linked list's items are ordered by the 2-> 33 ->4 -> 5 =>1-> 2-> 3-> 3-> 4 ->5
Computer Science In c++ (There should be three different files, "main.cpp", "sourcefile.cpp" and "header.cpp" your solution must have those three different files): Write a function that checks if the nodes in a linked list is sorted in ascending order. The function should return true if the values are sorted, otherwise false. Take user input. Call the funciton in the main function to show it is working.
in C++ kth ElementExtend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the deﬁnitions of these functions in the class linkedListType. please, do not copy from any other sources, give me a fresh new code. Thank you
You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Function Description Complete the insertNodeAtTail function in the editor below. insertNodeAtTail has the following parameters: SinglyLinkedListNode pointer head: a reference to the head of a list int data: the data value for the node to insert Returns SinglyLinkedListNode pointer: reference to the head of the modified linked list Input Format The first line contains an integer , the number of elements in the linked list.The next lines contain an integer each, the value that needs to be inserted at tail. Constraints Sample Input STDIN Function ----- -------- 5 size of linked list n = 5 141 linked list data values…
Write a function void printSecond(ListNode *ptr) that prints the value stored in the second node of a list passed to it as parameter. The function should print an error message and terminate the program if the list passed to it has less than two nodes.
Write a function called get_palindromes() that takes a list of words as input. The function should return a new list containing every word in the input list that is a palindrome (a palindrome is a word that reads the same forwards and backwards, like "noon" or "eve"). The output list should be a list of tuples, where each tuple consists of a palindrome and its length. NOTE: You must use a list comprehension to solve this exercise. Your function must be defined as a *single line* of code - CodeRunner will count the number of "new lines" inside your function definition, and there must be only one new line (separating the function header from the function body). The code editor below should show only two lines: one for the function header and one for the function body. Delete any blank lines within the function definition and do not add a new line at the end of the function body (i.e. at the end of the return statement)! For example: Test words = ["noon", "bob", "ann"] result =…
5. The following function indexCounter aims to find and return all the indices of the element x in a list L. if x is not in the list L, return an empty list. However, the implementation has a flaw, so that many times it will return error message. Can you fix the flaw? def indexCounter(L, x): indexList [] startIndex = 0 while startIndex < len(L): indexList.append (L.index (x, startIndex)) startIndex = L.index (x, startIndex) + 1 return indexList
Write a function that takes in n ADT Lists in an array. The function is going to be called Intersection, and it will return a new list with the elements common to all the n lists. Determine the time complexity
complete the following function. // It is the same as observeCounter except that f has a parameter of type List[Counter] not Counter. // f will insist that the List[Counter] has length 3. // You must return a List[Int] not an Int. // The first element of the result List[Int] must correspond to the number of times that increment/decrement were called on the first element of type List[Counter], similarly for the second and third elements. def observeCounterList (f : List[Counter] => Unit) : List[Int] = { // TODO: Provide definition here. List (-1, -1, -1) }
In this programming exercise you will implement two functions. The first function will prompt the user for a file containing the number of vertices and entries of the adjacency matrix of a graph. It will return a two-dimensional list (a list of lists) containing the adjacency matrix. The textfile is named inputfilename.txt am trying to read for the matrix [[0, 1, 2, 3, 100, 100, 100, 100], [1, 0, 2, 100, 3, 4, 100, 100], [2, 2 0, 4, 4, 100, 5, 100], [3, 100, 4, 0, 100, 100, 4, 100], [100, 3, 4, 100, 0, 3, 3, 3], [100, 4, 100, 100, 3, 0, 100, 1], [100, 100, 5, 4, 3, 100, 0, 2], [100, 100, 100, 100, 3, 1, 2, 0]] def readMatrix(inputfilename): ''' Returns a two-dimentional array created from the data in the given file. Pre: 'inputfilename' is the name of a text file whose first row contains the number of vertices in a graph and whose subsequent rows contain the rows of the adjacency matrix of the graph. ''' # Open the file f =…
Write a function that accepts two lists as it's only arguments. The function should return a new list containing all the elements of the two list arguments. For example, if the function was passed the lists [1, 2, 3] and [4, 5, 6], it would return a new list containing [1, 2, 3, 4, 5, 6]