Consider a singly linked list where each node contains two fields – integer data and node type pointer next. The head of the list and a value of the data is given. You have to find the node that contains the given data and delete that node. Data may occur at any position of the list including first or last. In case of unavailability of the given data, you have to print a message. You have to Implement a delete operation of a singly linked list.

Consider a singly linked list where each node contains two fields – integer data and node type pointer next. The head of the list and a value of the data is given. You have to find the node that contains the given data and delete that node. Data may occur at any position of the list including first or last. In case of unavailability of the given data, you have to print a message. You have to Implement a delete operation of a singly linked list.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 5SA

See similar textbooks

Similar questions

Consider a singly linked list where each node contains two fields – integerdata and node type pointer next. The head of the list and a value of the data isgiven. You have to find the node that contains the given data and delete thatnode. Data may occur at any position of the list including first or last. In caseof unavailability of the given data, you have to print a message. You have toImplement a delete operation of a singly linked list.Code in C
using c++ concepts of data structure Make a doubly linked list, take n inputs. Print it.Now, swap any two nodes (picked by the user), and print the list again. The node will be pickedon the basis of their value.Note: You have to swap the Node, by managing the links between them. NOT JUST THEVALUE INSDE THEM.
In C++, Consider a singly linked list where each node contains two fields – integer dataand node type pointer next. The head pointer of the list, a position, and a valueof data is given. You have to insert a node with the given value at the givenposition. You have to consider any position including first or last. You have toImplement an insert operation as per the above specification.
write a C++ Program Your task is to develop a program for a hospital where they need help to calculate and maintainthe number of patients, their disease, and their allotted room numbers. You will use a SinglyLinkedList to store record of a patient such as patient name, patient CNIC, patient disease, admitdate and patient allotted room number.Suppose if a patient has been recovered then, you will need to delete his Node from the list (Useall methods of deletion Start, Middle, and End). The system will use a special function named asDichargePatient() that will take patient CNIC as parameter, remove node of the patient, and returnsuccess status of the operation.Whenever a new patient is arrived at the hospital for admitting in a room. The system will useanother function AdmitPatient() that takes patient’s information, checks the availability of a room(assume that hospital only have 20 rooms and only one patient per room is allowed). If multiplerooms are available, then always allocate…
Suppose there are two singly linked lists both of which intersect at some point and become a single linked list. The head or start pointers of both the lists are known, but the intersecting node is unknown. Also, the number of nodes in each of the list before they intersect are unknown and both the list may have it different. List1 may have n nodes before it reaches intersection point and List2 might have m nodes before it reaches intersection point where m and n may be m = n, m > n or m < n. Give an algorithm for finding the merging point. Hints: A brute force approach would be to compare every pointer in one list with every pointer in another list. But in this case the complexity would be O(mn)
Imagine we have a linked list as shown below. The ListNodehas two fields: num, an integer, and next, a pointer to the next node. The list is not sorted. Write the definition of a function that calculates and returns the sum of the numbers in the list.
You need to develop a .NET library assembly (DLL) for a helper method to process a linked list, implemented as the static class LinkedListHelpers. You must provide a zip file with source code written in C#. You must also provide passing unit tests. a. Create a method that receives as input parameter the root node of a liked list and deletes the nodes with values that are repeated more than 2 times. Each node contains a character value from 'A' to 'Z'. The nodes in the list can come in any random order. You need to preserve the original order of the nodes. See the example below. Input: E E E в в A B After calling the method: E E B B A b. What is the time complexity and space complexity of your solution? Answer:
Given pointers to the head nodes of linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share a common node, return that node's value. Note: After the merge point, both lists will share the same node pointers. Example In the diagram below, the two lists converge at Node x: [List #1] a--->b--->c \ x--->y--->z--->NULL / [List #2] p--->q Function Description Complete the findMergeNode function in the editor below. findMergeNode has the following parameters: SinglyLinkedListNode pointer head1: a reference to the head of the first list SinglyLinkedListNode pointer head2: a reference to the head of the second list Returns int: the value of the node where the lists merge Input Format Do not read any input from…
1. Implement a function insertBook(Book newBook) to add a book at the end of thelinked list.a. Ask the librarian to input all the necessary book information.b. Use the information to create a Book objectc. Pass through the Book object as the parameter to the functiond. Store the Book object into the Node objecte. “Link” the object with the rest of the linked list2. Implement a function insertBefore(Book newBook, int bookID) to add a book infront of another book given its bookID.a. Ask the librarian to input all the necessary book information.b. Use the information to create a Book objectc. Pass through the Book object and bookID as the parameter to the functiond. Search for the matching Book objecte. Store the Book object into the Node objectf. “Link” the object with the rest of the linked list3. Implement a function searchBook(int bookID) to search for a book by its bookIDcode and return the book object.a. Ask the librarian to input the bookID.b. If the book doesn’t exist display an…
Write a program which should implement a linear linked list. Elements of this linked list should be of integer type, user will provide values as input for elements of this linked list. Your program should allow searching of a value specified by user in linked list and display also it index.
Assume that the node of a linked list is in the usual info-link form with the info of the type int. The following data, as described in parts (a) to (d), is to be insetred into an initially linked list: 72, 43, 8, 12. Suppose that head is a pointer of type nodeType. After the linked list is created, head should point to the first node of the list. Declare additional variables as you need them. Write the C++ code to create the linked list. After the linked list is created, write a code to print the list. What is the output of your code? a. Insert 72 into an empty linked list.b. Insert 43 before 72.c. Insert 8 at the end of the list.d. Insert 12 after 43.
write a c++ program in which: Create a linked list, size of linked list will be dependent on the user. Insert the numbers in the linked list till the linked list reaches the size. Create a menu and perform the following function on that linked list. Traversal: To traverse all the nodes one after another. Insertion: To add a node at the given position. Deletion: To delete a node. Searching: To search an element(s) by value. Updating: To update a node.