Implement a unique_insert(int num) function which will receive a number as parameter and insert it in a doubly-linked list. If the number is already in the list you will print that "the number already exists in the list" otherwise add the number in the list. Implement another traverse() function that will traverse the list and print all numbers in the list.

Implement a unique_insert(int num) function which will receive a number as parameter and insert it in a doubly-linked list. If the number is already in the list you will print that "the number already exists in the list" otherwise add the number in the list. Implement another traverse() function that will traverse the list and print all numbers in the list.

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

See similar textbooks

Similar questions

The function interleave_lists in python takes two parameters, L1 and L2, both lists. Notice that the lists may have different lengths. The function accumulates a new list by appending alternating items from L1 and L2 until one list has been exhausted. The remaining items from the other list are then appended to the end of the new list, and the new list is returned. For example, if L1 = ["hop", "skip", "jump", "rest"] and L2 = ["up", "down"], then the function would return the list: ["hop", "up", "skip", "down", "jump", "rest"]. HINT: Python has a built-in function min() which is helpful here. Initialize accumulator variable newlist to be an empty list Set min_length = min(len(L1), len(L2)), the smaller of the two list lengths Use a for loop to iterate k over range(min_length) to do the first part of this function's work. On each iteration, append to newlist the item from index k in L1, and then append the item from index k in L2 (two appends on each iteration). AFTER the loop…
Write a program that implements the doubly linked list clearly explain the steps for the following functions: a) Insert an element to doubly linked b) Delete an element from doubly linked list
5. The following function indexCounter aims to find and return all the indices of the element x in a list L. if x is not in the list L, return an empty list. However, the implementation has a flaw, so that many times it will return error message. Can you fix the flaw? def indexCounter(L, x): indexList [] startIndex = 0 while startIndex < len(L): indexList.append (L.index (x, startIndex)) startIndex = L.index (x, startIndex) + 1 return indexList
write a function that add any item in a linked list after the item X, if the item X is not found in the linked list don't add the item. data structre please solve it fast less than 30 minute
Old MathJax webview Old MathJax webview In Java Some methods of the singly linked list listed below can be implemented efficiently (in different respects) (as opposed to an array or a doubly linked list), others not necessarily which are they and why? b. Implement a function to add an element before the first element. c. Implement a function to add an item after the last one element. d. Implement a function to output an element of the list. e. Implement a function to output the entire list. f. Implement a function to output the number of elements. G. Implement a function to delete an item. H. Implement a function to clear the entire list. I. Implement functionality to search for one or more students by first name, last name, matriculation number or course of study. J. Implement functionality to sort the records of the student, matriculation number and course according to two self-selected sorting methods.
Write a function to sort a linked list of integers as follows: a) Find the largest value in the list. (the student should implement this function) b) delete it from its position and insert it at the head of the list. c) starting from what is now the second element, repeat (a) and (b). d) starting from what is now the third element, repeat (a) and (b). Continue until the list is sorted. please answer it in C++
Write a function with the signature below that returns the sum of the last k elements of a singly linked list that contains integers. int returnSumOfLastKNodes(Node* head, int k) Example: 10 -> 5->8->15->11->9->23 10 represents the head node, returnSumOfLastKNodes(Node* head, 4) will return 58.
Computer Science In c++ (There should be three different files, "main.cpp", "sourcefile.cpp" and "header.cpp" your solution must have those three different files): Write a function that checks if the nodes in a linked list is sorted in ascending order. The function should return true if the values are sorted, otherwise false. Take user input. Call the funciton in the main function to show it is working.
You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Function Description Complete the insertNodeAtTail function in the editor below. insertNodeAtTail has the following parameters: SinglyLinkedListNode pointer head: a reference to the head of a list int data: the data value for the node to insert Returns SinglyLinkedListNode pointer: reference to the head of the modified linked list Input Format The first line contains an integer , the number of elements in the linked list.The next lines contain an integer each, the value that needs to be inserted at tail. Constraints Sample Input STDIN Function ----- -------- 5 size of linked list n = 5 141 linked list data values…
Implement the following function def maxValue(alist: list)->int. alist contains integers only. This function finds and returns the largest numbr in the list. for example, alList-(1,5, 2), calling maxValue(alist) should return 5. Because 5 is the largest number in the list.
Write a function called EliminateDuplicates, the function takes in an ADT List, and it will eliminate the duplicates of that ADT List. Example: A = [3, 1, 4, 1, 1, 5, 9, 3, 4, 8, 3] EliminateDuplicates(A) Print(A.ToString()) Prints [3, 1, 4, 5, 9, 8]
For this problem you can use the singly linked list code implemented in lab class. Take an integer N (0<N<1000) as input from user. Generate N random values (range: 1-100) and store/deletethem sequentially by implementing the following function: node* notMoreThanTwo(node *head, int value)This function will add the number in head if this is first appearance, insert in tail if it is a duplicate value, and delete the first value if it is in list twice already. For each insertion print %dinserted and for deletion print %d deleted, where %d is the randomly generated value