Please teach me on how to make C program that will do the following operations using linked list: Insert(k): adds k to the start of the list with O(1) operation time Delete(): delete element at the start of the list with O(1) operation time PrintList(): display all the elements of the list with O(n) operation time Find(k): find the position of element with value k with O(n) operation time FindKth(k): find element at position k with O(n) operation time IsEmpty(): check if the number of elements in the list are zero with O(1) operation time.

Please teach me on how to make C program that will do the following operations using linked list: Insert(k): adds k to the start of the list with O(1) operation time Delete(): delete element at the start of the list with O(1) operation time PrintList(): display all the elements of the list with O(n) operation time Find(k): find the position of element with value k with O(n) operation time FindKth(k): find element at position k with O(n) operation time IsEmpty(): check if the number of elements in the list are zero with O(1) operation time.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter13: Structures

Section13.4: Linked Lists

Problem 2E

See similar textbooks

Similar questions

Answer the given question with a proper explanation and step-by-step solution. Write in Java: Write a menu-driven program to illustrate the use of a linked list. The entries will only consist of integer number keys (values). The program should implement the following options in order: • Insert- insert a key into a list- not allowing duplicate integers. • Delete- delete a key from the list. • Search- finds or does not find a particular key in the list. • Print- prints the list graphically in horizontal form. If the list is empty output- "Nothing to print". • Size- count of all the keys in the list. • Sort- sorts the keys in the list in ascending order. • Reverse- reverses the order of the keys in the list • Rotate- moves the key at the front of the list to the end of the list. If the list has 0 or 1 elements it should have no effect on the list. • Shift- rearranges the keys of a list by moving to the end of the list all values that are in odd number positions (indexes) and otherwise…
Write a program in Java to manipulate a Double Linked List: Count the number of nodes Insert a new node before the value 7 of Double Linked List Search an existing element in a Double linked list (the element of search is given by the user) Suppose List contained the following Test Data: Input the number of nodes : 4Input data for node 1 : 5Input data for node 2 : 6 Input data for node 3 : 7 Input data for node 4: 9
Write a C++ program to Split a Circular doubly Linked List into two equal parts. If the number of nodes in the list are odd then make first list one node extra than second list.
Write a program in c++ and make sure it works, that reads a list of students (first names only) from a file. It is possible for the names to be in unsorted order in the file but they have to be placed in sorted order within the linked list.The program should use a doubly linked list.Each node in the doubly linked list should have the student’s name, a pointer to the next student, and a pointer to the previous student. Here is a sample visual. The head points to the beginning of the list. The tail points to the end of the list. When inserting consider all the following conditions:if(!head){ //no other nodes}else if (strcmp(data, head->name)<0){ //smaller than head}else if (strcmp(data, tail->name)>0){ //larger than tail}else{ //somewhere in the middle} When deleting a student consider all the following conditions:student may be at the head, the tail or in the middleBelow, you will find a sample of what the file looks like. Notice the names are in…
Develop Java methods to perform the following operations on an unordered list (using linked lists). What is the complexity of each of these algorithms. 1. Insert an element at the start (front) of the list 2. Insert an element at the end (rear) of the list 3. Insert an element at the middle of the list following an element already in the list. 4. Remove an element from the middle of the list
Write a C++ program for linked list containing following methods. Add (Add at last) Add at first Add after value Search Remove given value Remove first Remove from last Display
Question : Write a c++ program which creates a Linked List having maximum sum out of two Sorted Linked Lists. Use this : LinkedList finalMaxSumList(LinkedList List1, LinkedList List2); For eg: You have two sorted linked lists, create a linked list that contains data with maximum sum. The resulting list with maximum sum will contain nodes with data from both input sorted lists. While creating the resulting list with maximum sum, we may switch to the other input list only at the point of intersection (which mean the two nodes with the same value in the lists). You are only allowed to use O(1) extra space. Note: You have to returned Linked List which contain finalMaxSumList and you are not allowed to change in data type and prototype of the Function. Input:List1 = 1->3->30->90->120->240->511List2 = 0->3->12->32->90->125->240->249 Returned LinkedList: Following is resulting linked list out of two sorted listsResultingList =…
Write a C program using Singly Linked list following instructions [As same as function name] int insertItemLast(int item);// Insert item at the last position of the listint insertItemAT(int position, int item);// Insert item at the given position of the listint NumOfItems(int item);// return the number of the occurrence of the given itemint deleteALLOccurrence(int item);// Delete all the occurrence of the given item in the list with preserving orderint deleteLastOccurrence(int item);// Delete the last occurrence of the given item in the listint deleteFirstItem(); // delete the first item of the listint deletelastItem();// delete the last item of the list
From page 147, #25: Design and implement an experiment that will compare the performance of a Python list with a list implmentd as a linked list
Write a BCPL program that reads a sequence of strings typed by the user and creates a linked list containing them all. But there will be some special command words. These should be obeyed but not inserted into the list An input of END will be used to mark the end of the input sequence. The progrm should stop. An input of ALL means that the whole list should be printed. It is perfectly OK for the list to come out backwards. An input of DELETE means that the next word is to be removed from the list and its memory (for the link object and for the string) must be recycled with freevec (even though freevec doesn't do anything yet). Remember you will need to implement and use strdup(). Remember that strings are packed, four bytes per word, into an array. You use the "byte N of S" syntax to access the individual bytes. Also remember that an extra 0 byte is added to mark the end of the string. Example run: $ run hw4 Enter the strings and deletions: > hello > this > program > works…
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.
Write a C++ program to add two large integers with up to 300 digits. One approach is to treat each number as a list, each of whose elements is a block of digits of that number. For example, the integer 179,534,672,198 might be stored with block[O] = 198, block[l] = 672, block[2] = 534, block[3] = 179. Then add two integers (lists), element by element, carrying from one element to the next when necessary.