Less'Implement an extractLessThan operation on a singly-linked list with notail pointer. Your code SHOULD NOT delete memory, only return a new LinkedListwith the value less than parameter value. Your code must not call other LinkedListfunctions. Order of the extracted nodes does not matter.8.struct LinkNode {Data • data; // note that you can compare by calling data->compareTo(other)LinkNode • next;};class LinkedList {LinkNode • head;• Returns a nev LinkedList that contains all of the LinkNodes from this• LinkedList that have node->data->compareTo (value) < 0.• LinkedList •x- ... // x contains [5, 8, 1, 3]• Data • value - new IntegerData (4);• LinkedList • y- x->extractLessThan(value);• // x nov contains [5, 8] and y nov contains (3, 1// You have access to head and to thisLinkedList extractLessThan (Data • value) {LinkedList nevList - new LinkedList();LinkNode • current - head;LinkNode • previous- NULL;

Problem: Implement an extractLessThan operation on a singly-linked list with no tail pointer. Your…

Answered: Less'Implement an extractLessThan…

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16SA

See similar textbooks

Similar questions

C# Assume you have a LinkedList of Node objects. Both classes have all the normal operations shown below. Your job is to program the DeleteTail method of the LinkedList class. This method locates and deletes the last element of the linked list. You may not change its signature line. Keep your code clean, but no documentation is necessary. A good solution will be between 5 and 10 lines of code, not counting whitespace.
JAVA CODE Learning Objectives: Detailed understanding of the linked list and its implementation. Practice with inorder sorting. Practice with use of Java exceptions. Practice use of generics. You have been provided with java code for SomeList<T> class. This code is for a general linked list implementation where the elements are not ordered. For this assignment you will modify the code provided to create a SortedList<T> class that will maintain elements in a linked list in ascending order and allow the removal of objects from both the front and back. You will be required to add methods for inserting an object in order (InsertInorder) and removing an object from the front or back. You will write a test program, ListTest, that inserts 25 random integers, between 0 and 100, into the linked list resulting in an in-order list. Your code to remove an object must include the exception NoSuchElementException. Demonstrate your code by displaying the ordered linked list and…
int F(node<int>&p){int c=0; while(p!=0){p=p->next; c++; } return c;} This function is a. return the number of items in the linked list b. return the number of items in a linked list and destroy the linked list c. None of these d. destroy the list and free all allocated nodes
- the constructor needs to initialize tailPtr to nullptr - insert(): modify it to update prev pointers as well as next pointers. - remove(): modify to update prev pointers as well as next pointers. Add a new public member function to the LinkedList class named reverse() which reverses the items in the list. swap each node’s prev/next pointers, and finally swap headPtr/tailPtr. Demonstrate your function works by creating a sample list of a few entries in main(), printing out the contents of the list, reversing the list, and then printing out the contents of the list again to show that the list has been reversed. Note: your function must actually reverse the items in the doubly-linked list, not just print them out in reverse order! we won't use the copy constructor in this assignment, and as such you aren't required to update the copy constructor to work with a doubly-linked list. @file LinkedList.cpp */ #include "LinkedList.h" // Header file#include <cassert>#include…
void doo(node<int>*root){ if(root !=0) { node<int>*p=root; while(root->next!=0) root=root->next; p->data=root->data; } What is this code do? a. swap the first item with the last item in the linked list b. doesn't do anything because the root parameter is passed by value c. set the first item in the linked list as the last item d. change the root item in the binary tree with the farthest leaf item
8. Implement an extractLessThan operation on a singly-linked list with no tail pointer. Your code SHOULD NOT delete memory, only return a new LinkedList with the value less than parameter value. Your code must not call other LinkedList functions. Order of the extracted nodes does not matter. struct LinkNode { Data • data; // note that you can compare by calling data->compareTo(other) LinkNode • next; class LinkedList { LinkNode • head; • Returns a nev LinkedList that contains all of the LinkNodes from this • LinkedList that have node->data->compareTo (value) extractLessThan (value); • // x nov contains [5, 8] and y now contains (3, 1] // You have access to head and to this LinkedList • extractLeseThan (Data • value) { LinkedList • nevList - nev LinkedListO: LinkNode • current - head; LinkNode • previous - NULL;
c++ Given main.py and a Node class in Node.py, complete the LinkedList class (a linked list of nodes) in LinkedList.py by writing the insert_in_ascending_order() method that inserts a new Node into the LinkedList in ascending order.
Answer using C languageIn this project, you will implement a Polynomial ADT using LinkedLists. You will implement the Multiplication, Addition, and Subtractionoperations of polynomials.Your program should be able to read a file of polynomials calledequations.txt and store each equation in a doubly-linked list. Once thefile is read and equations are loaded into the linked lists, the usershould be able to perform mathematical operations on thepolynomials (addition, subtraction, and multiplication). Once the userselect an operation through a menu, the output should be displayedand then the menu should show again. Another option for the user isto store the results of all operations in a file called results.txt. Yourapplication should show an appropriate screen with menu options toinform the user of the available operations to let her/him to choosefrom.Example of input file:2x^7+10x^5-10x^3+2x+1-15x^7-10x^5+90x^2-22x^2 + x - 1Upon user selection, the application should show the output of…
Question 2: Linked List Implementation You are going to create and implement a new Linked List class. The Java Class name is "StringLinkedList". The Linked List class only stores 'string' data type. You should not change the name of your Java Class. Your program has to implement the following methods for the StringLinked List Class: 1. push(String e) - adds a string to the beginning of the list (discussed in class) 2. printList() prints the linked list starting from the head (discussed in class) 3. deleteAfter(String e) - deletes the string present after the given string input 'e'. 4. updateToLower() - changes the stored string values in the list to lowercase. 5. concatStr(int p1, int p2) - Retrieves the two strings at given node positions p1 and p2. The retrieved strings are joined as a single string. This new string is then pushed to the list using push() method.
In c++ please explain the code Q1. Given a 'key', delete the first occurrence of this key in the linked list. Iterative Method: To delete a node from the linked list, we need to do the following steps. 1) Find the previous node of the node to be deleted. 2) Change the next of the previous node. 3) Free memory for the node to be deleted.
C++ program to give implementation of circular linked list and should have the following functionality. -InsertFirst ( ? ) -InsertLast ( ? ) -InsertSpecific ( ? ) -DisplayList ( ? ) -DeleteFirst ( ? ) -DeleteLast ( ? ) -DeleteSpecific( ? ) Note: solve as soon as possible
Duplicate Set This function will receive a list of elements with duplicate elements. It should add all of the duplicate elements to a set and return the set containing the duplicate elements. A duplicate element is an element found more than one time in the specified list. The order of the set does not matter. Signature: public static HashSet<Object> duplicateSet(ArrayList<Object> list) Example: INPUT: [2, 4, 5, 3, 3, 5] OUTPUT: {5, 3}

SEE MORE QUESTIONS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning