3. The pointer start points to the first element of a singly-linked list L. Write a recursive algorithm replace(start) to replace the value of each element of L with that of the next element in L. The value of the last element of L should be set to zero. An illustration is shown in Figure 1. 2 7 null 7 null

3. The pointer start points to the first element of a singly-linked list L. Write a recursive algorithm replace(start) to replace the value of each element of L with that of the next element in L. The value of the last element of L should be set to zero. An illustration is shown in Figure 1. 2 7 null 7 null

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

See similar textbooks

Similar questions

1. a function that takes in a list (L), and creates a copy of L. note: The function should return a pointer to the first element in the new L. [iteration and recursion]. 2. a function that takes in 2 sorted linked lists, and merges them into a single sorted list. note: This must be done in-place, and it must run in O(n+m).
struct node{int num;node *next, *before;};start 18 27 36 45 54 63 The above-linked list is made of nodes of the type struct ex. Your task is now to Write a complete function code to a. Find the sum of all the values of the node in the linked list. b. Print the values in the linked list in reverse order. Use a temporary pointer temp for a and b. i dont need a full code just the list part
C++ Create a generic function add_bookends(ls, e) that adds a copy of element e to the front and back of list ls.
Please fill in the blanks for C /* This program will print students’ information and remove students using linked list: */ #include<stdio.h> #include<stdlib.h> //Declare a struct student (node) with 5 members //each student node contains an ID, an age, graduation year, // 1 pointer points to the next student, and 1 pointer points to the previous student. struct student { int ID; int age; int classOf; __1__ __2__ next; __3__ __4__ prev; }; /* - This function takes the head pointer and iterates through the list to get all 3 integers needed from the user, and save it to our list - Update the pointer to point to the next node. */ __5__ scanLL(__6__ __7__ head) { while(__8__ __9__ __10__) //this condition makes sure the list is not at the end { printf("Lets fill in the information. Enter 3 integers for the student's ID, age, and graduation year: ");…
Please fill in the blanks for C. // Singly Linked List #include<stdio.h> // Part 1 //Declare a node of character // each node has a value and a pointer that points to the next node struct charNode { __1__ val; __2__ __3__ next; }; /*This function takes the first pointer (head) and iterates through the list to print one character at a time.*/ __4__ printCharLL(__5__ __6__ curPtr) { printf("\nPrinting back the list: \n"); while(__7__ __8__ __9__) //condition to keep running the loop { printf("%c", __10__); //print the value using pointer, no spaces curPtr = __11__; //move the pointer to point to the next node in list, no spaces } printf("\n"); } // Part 2 //Declare a node of double // each node has a value and a pointer that points to the next node struct doubleNode { __12__ val; __13__ __14__ next; };…
Write a program in c++ to remove duplication if exists in the linked list. Write 2 separate functions to perform search and other to perform the duplication removal. Note: the above mentioned task is to be performed using singly linked list and in c++
Consider the below code of circular linked list. Your work is to update the same code, by providing the functionalities with tail pointer only. #include <iostream> using namespace std; class Node{ public: int data; Node *next; }; class List{ public: Node *head; List(){ head = NULL; } void insert(int data){ Node *nn = new Node; nn->data = data; if(head==NULL){ head = nn; nn->next = head; cout<<"Node inserted successfully at head"<<endl; } else{ Node *temp = head; while(temp->next!=head) temp = temp->next; nn->next = head; temp->next=nn; cout<<"Node inserted successfully at end"<<endl; } } void insertInBetween(Node *node, int data){ Node *nn = new Node; nn->data = data; Node *temp = node->next;…
write a c++ code that will do the adding a node to a doubly-linked list in the three cases (insert a node at the beginning-middle-end). A separate function is required for each case.
Write a function REMOVE-NUM that takes a list and returns a list consisting of the original list with all numeric atoms removed. Examples: (REMOVE-NUM '(2 A 6 B 1 C 7 D)) returns the list (A B C D) (REMOVE-NUM '(3 A 4 B (1 E) 7 D)) returns the list (A B (E) D)
Write a function that changes the places of the first and second nodes of a linked list. I.e. the First node will become the second node, and the second node will become the first node. THE FUNCTION WILL NOT EXCHANGE DATA, IT WILL CHANGE LINKS.
Q.2. Implement a single linked list. Elements of this linked list should be of integer type, user would provide values as input for elements of this linked list. Which does not allow insertion of duplicate value to the list.
Given the declaration below, write the C++ code as asked. The pointer variable myList points to the first node of the linked list. Declaration: