Question 2:Using only LLNode.java class. Create a demo class called LinkedListDemo.java. In this democlass, write a public static method called SumNode that receives a reference calkled list of typeLLNode of integer vakues. Your method shoukl sum all the nodes content and then add a new nodecontains the summation to the end of the list.For example, if the list contains:list6Then after calling the method SumNode, the list becomes:list563611------- Paste SumNode code below this lineGood Luck O3.4.

Explanation: The first step is to create a function that will insert the nodes in the linked list…

Using only LLNode.java ckass. Create a demo class called LinkedListDemo.java. In this demo class, write a public static method called SumNode that receives a reference called list of type LLNode of integer vakes. Your method shoukd sum all the nodes content and then add a new node contains the summation to the end of the list. For example, if the list contains:

Using only LLNode.java ckass. Create a demo class called LinkedListDemo.java. In this demo class, write a public static method called SumNode that receives a reference called list of type LLNode of integer vakes. Your method shoukd sum all the nodes content and then add a new node contains the summation to the end of the list. For example, if the list contains:

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

Implement a lastIndex method for the LinkedIntList class you worked on for HW4. This method takes an int argument and returns the largest index such that the int argument appears at that index in the list. If the int argument does not appear in the list, then -1 is returned. For example if the list example contained the numbers [4, -1, 2, 7, -1, 3] in that order, then example.lastIndex(-1) should return 4 and example.lastIndex(5) should return -1. In the text area below, write the definition of the lastIndex method. (In other words, write the code that should replace the //TODO comment.) Your code cannot call any methods. public class LinkedIntList { private class Node { private int item; private Node next; public Node() {} public Node(int number, Node nextNode) { item = number; next = nextNode; } } private Node first; // first node of the list public LinkedIntList() { first = null;…
implement a method which takes two LinkedIntLists as input and returns a new list containing all the items of the first followed by all the items of the second. Don't modify the input lists; use the new keyword to create new objects instead. /** * Returns a list consisting of the integers of a followed by the integers * of n. Does not modify items of A or B. */ public static LinkedIntList concatenate(LinkedIntList a, LinkedIntList b) { }
Add a new method to your TSortedList called removeDuplicates(). The method should scan the linked list and remove any duplicates. Note that the list is already sorted. So, you have to just remember the last element seen in order to decide whether the next element is a duplicate or not. Test your method with the following input to {7,15, 3, 2, 1, 3, 7, 15} an empty sorted list. After invoking removeDuplicates() and printing the resulting list, the output should be {1,2,3,7,15}.
Implement an instance method, called getFirstHalf, that belongs to yourThingLinkedBag. The method returns as output a linked list that includes allvalues in the first half of the bag's linked list. For example, for the following bag3-->5-->8-->9. the method returns 3-->5.If the bag includes an odd number of nodes, then the middle element belongs tothe first half and is included in the output.Make sure to include the methodheader. The bag should remain unchanged (i.e., do not remove the returnedvalues from the bag).
Java
Write a method called InsertAfter to be included in the KWLinkedList class, the method has three parameters p1, p2 and p3 of type E. The list has at least two nodes (no need to check). The method inserts a node having its data as p3 after a node having data as p2 if preceded with a node having data as p1 (after insertion it will be .p1.p2.p3.), then quits. You must use iterator to solve the problem. The method head is public void insertAfter(E p1, E p2, E p3) Example: Before run: Assume p1:5 p2: 7 p3: 100 List: 2 58 57 12 10 576 After run: List: 2 5 8 5 7 100 12 10 5 7 6
Write a method called copyConditional to be included in the class SingleLinkedList that accepts a parameter listl of type SingleLinkedList and item of type E. If "this" list is empty, it will return false, otherwise, it will copy the elements of "this" list to listl which are smaller than item. Assume that list1 is initially empty. Do not call any method of class SingleLinkedList. Method heading: public boolean copyConditional (SingleLinkedList listl, E item) Note: Copy here means creating and adding new nodes in list1. Example : item = 10 Before method call: "this" list: 17 8 6 5 12 9 16 list1: ( empty ) After method call: "this" list: 17 6 5 5 9 8 12 9 16 list1: 8 6
15 DO NOT COPY FROM OTHER WEBSITES Correct and detailed answer will be Upvoted else downvoted. Thank you!