Below you're given a Node class and a LinkedList class. You will implement amethod for the LinkedList class named "delete48in148". That is, whenever thereis a sequence of nodes with values 1, 4, 8, we delete the 4 and 8. For exCample,Before: 1 -> 4 -> 8LAfter: 1Before: 7 -> 1 -> 4 -> 8 -> 9 -> 4 -> 8After: 7 -> 1 -> 9 -> 4 -> 8Before: 7 -> 1 -> 4 -> 8 -> 4 -> 8 -> 4 -> 8 -> 9After: 7 -> 1 -> 9Note from the above example that, after deleting one instance of 48, theremay be new instances of 148 formed. You must delete ALL of them.Requirement: Your implementation must be ITERATIVE (i.e., using a loop).You must NOT use recursion. Recursive solutions will NOT be given marks.import...# No other import is allowed class Node:A node in the linked Listvalue: intnext: Optional (Node]definit_ (self, value: int, nx: Node = None):self.value = valueself.next = nxclass LinkedList:The LinkedList is empty if and only if self.head is Nonehead: Optional (Node]def init_(self, head: Optional [Node]):self.head = headdef delete48in148(self) -> None:In all occurrences of 148, delete the 48.TODO: complete this methodYour implementation must be ITERATIVE (1.e., using a loop).You must NOT use recursion.Recursive solutions will NOT be given marks.pass

def delete48in148(self)->None: first = self.head #If no element is present…

Below you're given a Node class and a LinkedList class. You will implement a method for the LinkedList class named "delete48in148". That is, whenever there is a sequence of nodes with values 1, 4, 8, we delete the 4 and 8. For example,

Below you're given a Node class and a LinkedList class. You will implement a method for the LinkedList class named "delete48in148". That is, whenever there is a sequence of nodes with values 1, 4, 8, we delete the 4 and 8. For example,

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

Question 2: Using only LLNode java cass. Create a demo cass called LinkedlistDemo java. In this demo class, write a public static method called SumNode that receives a reference caled list of type LLNode of integer values. Your method shoukl 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: list Then after calling the method SumNode, the list becomes: list 36 11------- Paste SumNode code below this line Good Luck O
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;…
JAVA please Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts Code provided in the assignment ItemNode.java:
Write a method called inversePrint. This method gets a head of a linkedlist and Recursively print from the last item to the first one. This is a Recursive method. If Recursive is not used you will get no mark for this question Do not reverse the linkedlist, only print it in reverse example call: in the main I will call your method like: buffer = myList.head; //This is a buffer to copy the head address inversePrint(buffer); After this, the order for myList should not changed. if myList has: 1->2->3->4->5 your function should print: 5-> 4 -> 3->2->1 but if I check myList the order should still be 1->2->3->4->5 you can assume the LinkedList code for all other operations exist and if you need you can use them Do Not create a new linkedlist in inverse Hint: use recursion does this for you really easy
Given main.py and a PersonNode class, complete the PersonList class by writing find_first() and find_last() methods at the end of the PersonList.py file. The find_first() method should find the first occurrence of an age value in the linked list and return the corresponding node. Similarly, the find_last() method should find the last occurrence of the age value in the linked list and return the corresponding node. For both methods, if the age value is not found, None should be returned. The program will replace the name value of each found node with a new name. Ex. If the input is: Alex 23 Tom 41 Michelle 34 Vicky 23 -1 23 Connor 34 Michela main.py(can not edit) from PersonNode import PersonNodefrom PersonList import PersonList if __name__ == "__main__": person_list = PersonList() # Read input lines until encountering '-1' input_line = input() while input_line != '-1': split_input = input_line.split(' ') name = split_input[0] age =…
Given the source code of linked List, answer the below questions(image): A. Fill out the method printList that print all the values of the linkedList: Draw the linked list. public void printList() { } // End of print method B. Write the lines to insert 10 at the end of the linked list. You must draw the final linked List. Notice that you can’t use second or third nodes. Feel free to define a new node. Assume you have only a head node C. Write the lines to delete node 2. You must draw the final linked list. Notice that you can’t use second or third node. Feel free to define a new node. Assume you have only a head node
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).
Complete the code for the removeFirst method, which should remove and return the first element in the linked list. Throw aNoSuchElementException if the method is invoked on an empty list. import java.util.NoSuchElementException; public class LinkedList { private Node first; public LinkedList() { first = null; } public Object getFirst() { if (first == null) { throw new NoSuchElementException(); } return first.data; } public Object removeFirst() { // put your code here } class Node { public Object data; public Node next; } }
Java's LinkedList provides a method listlterator(int index) returning a Listlterator for a list. Declare a variable of LinkedList of integer numbers and write a fragment of Java code to compute and print the sum of the numbers on the list. Do not write code to insert elements to the list and assume that the list already has elements on it. You must only use an iterator obtained from the list (you can not use the get(int index) method) .
Add more methods to the doubly linked list class then test them• search(e) // Return one node with 3 values (stuID, stuName, stuScore) which matches agiven key e (studentID).• addAfter(e, stuID, stuName, stuScore) //Add a new node with 3 values (stuID,stuName, stuScore) after the node with the key e (studentID).• removeAt(e) //Remove a node which matches a given key e (studentID)• count() //Return a number of nodes of list.• update(stuID, stuName, stuScore) //Update the values of one node first code below package DlinkedList;public class DLinkedList<A,B,C> { private Node<A,B,C> header; private Node<A,B,C> trailer; private int size; public DLinkedList() { header = new Node<>(null, null, null); trailer = new Node<>(null, null, null); header.setNext(trailer); trailer.setPrev(header); } public int getSize() { return size; } public boolean isEmpty() { return size==0; } public A…
Please use Java Write a method “removeHighestLinkedList” that takes a LinkedList and removes the highest value.
Given main() and an IntNode class, complete the IntList class (a linked list of IntNodes) by writing the insertInAscendingOrder() method that inserts a new IntNode into the IntList in ascending order. Ex. If the input is: 8 3 6 2 5 9 4 1 7 -1 the output is: 1 2 3 4 5 6 7 8 9 import java.util.Scanner; public class SortedList {public static void main (String[] args) {Scanner scnr = new Scanner(System.in);IntList intList = new IntList();IntNode curNode;int num;num = scnr.nextInt();// Read in until -1while (num != -1) {// Insert into linked listcurNode = new IntNode(num);intList.insertInAscendingOrder(curNode);num = scnr.nextInt();}intList.printIntList();}}