9.5 Write a method of SinglyLinkedList, called reverse, that reverses the order of the elements in the list. This method should be destructive—it should modify the list upon which it acts. 9.6 Write a method of DoublyLinkedList, called reverse, that reverses the order of the elements in the list. This method should be destructive.

9.5 Write a method of SinglyLinkedList, called reverse, that reverses the order of the elements in the list. This method should be destructive—it should modify the list upon which it acts. 9.6 Write a method of DoublyLinkedList, called reverse, that reverses the order of the elements in the list. This method should be destructive.

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 5PE

See similar textbooks

Similar questions

9.5 Write a method of SinglyLinkedList, called reverse, that reverses theorder of the elements in the list. This method should be destructive—it shouldmodify the list upon which it acts.9.6 Write a method of DoublyLinkedList, called reverse, that reverses theorder of the elements in the list. This method should be destructive.9.7 Write a method of CircularList, called reverse, that reverses theorder of the element in the list. This method should be destructive.9.8 Each of the n references in a singly linked list are needed if we wishto remove the final element. In a doubly linked list, are each of the additional n previous references necessary if we want to remove the tail of thelist in constant time? (Hint: What would happen if we mixed Nodes andDoublyLinkedNodes?)
2) Consider a class for a node of a doubly linked list: class node{ String name; String city; node llink, rlink; } Use the above class and create a class for doubly linked list which consists of methods that performs the following: i. Insert a node at the beginning ii. Insert a node at the end ii. Display all the names in doubly linked list where city name is common iv. Delete a node from the end v. Search and delete specific node. Write and execute a java program to create an object of this class. Use the object of this class to read required data from user and demonstrate the working of methods with appropriate messages and proper comments.
COMPLETE THIS CODE and make sure it passes all the test cases.// EXERCISE 4.1 MYLIST ITERATIVE CATENATE MUTATE /** * Catenate two MyLists, listA and listB. Mutate listA. * @param listA is a MyList object. * @param listB is a MyList object. * @return a list consisting of the elements of listA followed by the * elements of listB. */public static MyList iterCatMutList(MyList listA, MyList listB) { }
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.
java program java method: Write a method replace to be included in the class KWLinkedList (for doubly linked list) that accepts two parameters, searchItem and repItem of type E. The method searches for searchItem in the doubly linked list, if found then replace it with repItem and return true. If the searchItem is not found in the doubly linked list, then insert repItem at the end of the linked list and return false. Assume that the list is not empty. You can use ListIterator and its methods to search the searchItem in the list and replace it with repItem if found. Do not call any method of class KWLinkedList to add a new node at the end of the list. Method Heading: public boolean replace(E searchItem, E repItem) Example: searchItem: 15 repItem: 17 List (before method call): 9 10 15 20 4 5 6 List (after method call) : 9 10 17 20 4 5 6
c)Define a class that implementsa singly linked list with the following methods, assuming that the first node of a linked list is referred to by head:i) A constructor.ii) searchNode that takes asparameter an integer value and returns a reference to the node with that value if it is found,and null otherwise. i)addlnOrder that allows insertion of a node to the linked list such that the list remainssorted in ascendingorder.iv) displayList which displays all the nodes in the linked list.d) Assuming that the class defined in part (c) aboveis used to implement a queueofpositive integers, define the following methods which can be used to implement queueoperations:i) isEmptythat returns true if the queue is empty andfalse otherwise.ii) pop that returns the value of the first node if the linked list is not empty,and -1 otherwise.iii) push that takes as parameteran integer value and adds it to the end of the queue.
Reference-based Linked Lists: Select all of the following statements that are true. As a singly linked list's node references both its predecessor and its successor, it is easily possible to traverse such a list in both directions. According to the terminology introduced in class, the head reference variable in a singly linked list object references the list's first node. According to the terminology introduced in class, in a doubly linked list, each node references both the head and tail node. In a double-ended singly linked list, the tail reference variable provides access to the entire list. In a circular linked list, the last node references the first node.
PLEASE TYPE ONLY**** PROGRAM 2 Write a java program that calls a method called removeZeroes that takes as a parameter an ArrayList of integers and eliminates any occurrences of the number 0 from the list. For example, if the list stores the values [0, 4, 5, 0, 6, 0, 1] before the method is called, it should store the values [4, 5, 6, 1] after the method finishes executing. Print the ArrayList before and after the method call.
2. Linked ListsCreate a class called OurLinkedList and implement the following methods:1- Write a method called add() that takes a linked list of integers along an integerand adds that integer to the list.2- Write a method called print() that takes a linked list of integers and prints all itselements.3- Write a method called deleteAll() that takes a linked list of integers along an integer which deletes all the occurrences of this number in the linked list. So if the item is 7 and the list is [1,3,7,4,3,7,2], the result is [1,3,4,3,2].4- Write a method called indexesOf() that takes a linked list of integers along withan integer and returns a list of the positions of all the occurrences of that integer.So if the integer is 5 and the list is [2,4,5,8,1,5,3], the result is [2,5].
8.12 LAB: Binary search Binary search can be implemented as a recursive algorithm. Each call makes a recursive call on one-half of the list the call received as an argument. Complete the recursive method binarySearch() with the following specifications: Parameters: a target integer an ArrayList of integers lower and upper bounds within which the recursive call will search Return value: the index within the ArrayList where the target is located -1 if target is not found The template provides main() and a helper function that reads an ArrayList from input. The algorithm begins by choosing an index midway between the lower and upper bounds. If target == integers.get(index) return index If lower == upper, return -1 to indicate not found Otherwise call the function recursively on half the ArrayList parameter: If integers.get(index) < target, search the ArrayList from index + 1 to upper If integers.get(index) > target, search the ArrayList from lower to index - 1…
Question 5.1 Write a Python program that creates an unordered, singly-linked list consisting of 8 items. Each item in the linked list should be a number. You can use the code given in the lecture slides for your Node and UnorderedList classes. Your node class should contain the following functions: • a constructor • get_data() – returns the data in the node • get_next() – returns the next node in the list set_data() – sets the data in the node to the value given as a parameter set_next() – sets the node that this node links to, to the node given as a parameter Your UnorderedList class should contain the following functions: • a constructor • add() – adds a node to the head of the list, containing the number given in the parameter • is_empty() – returns True if the list is empty, and False otherwise • size() – returns the size of the list • print_list() – displays the contents of all nodes in the list Add code to create an UnorderedList object, and call its add() function to add 8 items…
Exercise 1• Create a class that sorts a list in ascending order. Make use of the Collections method sort• The list should be a list of Strings.• Test your code with {“Hearts”, “Diamonds”, “Clubs”, “Spades”}• Before and after the sort, use the implicit call to the list’s toString method to output the list contents. Exercise 2• Create a class with the same requirement as in Exercise 1, but the sort should be in descending order• Make use of the Comparator interface• Make use of the static collection method reverseOrder java