A linked list is developed with the following set of nodes in sequence: 25, 40, 66, 38 and 53. The list first node is referred by First reference variable. The second node is referred by P reference variable while the second last node is referred by Q reference variable. Compose Java statements for the following operations: a) Replace the third node value to 55 using all possible reference variables. b) Delete the last node using the shortest path of reference variable. Then deallocate the memory. Shows all steps involved. c) Insert new node with value 99. Make the new node as third node in the list. Shows all steps involved. d) Destroy the linked list.

A linked list is developed with the following set of nodes in sequence: 25, 40, 66, 38 and 53. The list first node is referred by First reference variable. The second node is referred by P reference variable while the second last node is referred by Q reference variable. Compose Java statements for the following operations: a) Replace the third node value to 55 using all possible reference variables. b) Delete the last node using the shortest path of reference variable. Then deallocate the memory. Shows all steps involved. c) Insert new node with value 99. Make the new node as third node in the list. Shows all steps involved. d) Destroy the 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 18SA

See similar textbooks

Similar questions

In java The following is a class definition of a linked list Node:class Node{int info;Node next;}Assume that head references a linked list and stores in order, the int values 5, 7 and 9. Show the instructions needed to delete the Node with 5 so that head would reference the list 7 and 9.
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 //…
In Java, The following is a class definition of a linked list Node: class Node{int info;Node next;}Assume that head references a linked list and stores in order, the int values 5, 2 and 9. Show the instructions needed to move the value 2 in front of the value 5 so that the list is now 2, 5 and 9.
Please code this in Java Or C or C++ Given two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and return the sum as linked list: Example : Input : (7-> 1 -> 6) + (5-> 9-> 2). That is 617 + 295 = 912 Output : 2-> 1 -> 9 Expected time complexity : O(m+n), where m and n are no. of nodes in first and second linked list respectively.
Please code this question in Java according to the function attached in picture. Given two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and return the sum as linked list: Example : Input : (7-> 1 -> 6) + (5-> 9-> 2). That is 617 + 295 = 912 Output : 2-> 1 -> 9 Expected time complexity : O(m+n), where m and n are no. of nodes in first and second linked list respectively.
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…
python 8.7 LAB: Writing append and search methods (singly-linked list)Given main.py and a Node class in Node.py, complete the LinkedList class in LinkedList.py by writing the append() and search() methods. The search() method should return the Node whose data value matches a given key, and None if the key is not found. The search() method should also set the position of each Node searched in the LinkedList, starting with 1. Ex: If the input is: 12 23 59 37 923 212the output is: 12 found in list at position 1.If the input is: 12 23 59 37 923 268the output is: 68 not found in list.
6.Need ri Write a JAVA program that will maintain a phone directory using a Linked-List. The program should be able to perform the following operations: Add persons details (first name, last name, phone number, city, address, sex and email) to the phone directory, where phone numbers in the directory have to be unique. (Note: each person record will store in one node in the linked-list and insert each person to the last) Delete any person details by a given phone number. Update telephone number by providing person first name. Display all details of persons from a phone directory. Search telephone number based on person first name. (Note: use sequential search to find all telephones for the given first name) Sort all persons in the phone directory ascending based on person first name. (Note: use bubble or selection sort to arrange the entire phone directory.
Assume a linked list contains following integers: 2, 2, 4, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode; curNode=new Node<int>(10,head); head=curNode; int a; while(curNode!=NULL){ a+=curNode->getItem(); curNode=curNode->getNext(); } A.49 B.39 C.7 D.15
Assume a linked list contains following integers: 5, 2, 4, 6, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a=0; while(curNode!=NULL){ a+=curNode->getItem(); curNode=curNode->getNext(); if(curNode!=NULL) curNode=curNode->getNext(); } A.32 B.43 C.19 D.18
Suppose a node of a linked list is defined as follows in your program: typedef struct{ int data; struct Node* link; } Node; Write the definition of a function, printOdd(), which displays all the odd numbers of a linked list. What will be the time complexity of printOdd()? Express the time complexity in terms of Big-O notation.