Problem Solving with C++ (10th Edition)
10th Edition
ISBN: 9780134521176
Author: SAVITCH
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 13, Problem 1PP
Write a void function that takes a linked list of integers and reverses the order of its nodes. The function will have one call-by-reference parameter that is a pointer to the head of the list. After the function is called, this pointer will point to the head of a linked list that has the same nodes as the original list, but in the reverse of the order they had in the original list. Note that your function will neither create nor destroy any nodes. It will simply rearrange nodes. Place your function in a suitable test
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
Write a function that gets a linked list of ints, and reverses it. For example
- on input 1 -> 2 -> 3 -> 4, after the function finishes the execution, the list
becomes 4 -> 3 -> 2 -> 1
- If the list has one element, then it doesn’t change
- If the list is empty, then it doesn’t change
You may use the data fields in the struct and the functions provided in LL.h and LL.c.
// reverses a linked list
void LL_reverse(LL_t* list);
Test for the Function:
void test_q3() {
LL_t* lst = LLcreate();
LL_add_to_tail(lst, 1);
LL_add_to_tail(lst, 3);
LL_add_to_tail(lst, 8);
LL_add_to_tail(lst, 4);
LL_add_to_tail(lst, 3);
LL_reverse(lst);
intcorrect[] = {3,4,8,3,1};
inti;
node_t* n = lst->head;
for(i=0;i<5;i++) {
if (n==NULL) {
printf("Q3 ERROR: node %d==NULL unexpected\n", i);
return;
}
if (n->data != correct[i]) {
printf("Q3 ERROR: node%d->data==%d, expected %d\n", i, n->data, correct[i]);
return;
}
n = n->next;
}
if (n==NULL)
printf("Q3 ok\n");
}
Support…
Write a function that gets a linked list of ints, and reverses it. For example
- on input 1 -> 2 -> 3 -> 4, after the function finishes the execution, the list
becomes 4 -> 3 -> 2 -> 1
- If the list has one element, then it doesn’t change
- If the list is empty, then it doesn’t change
You may use the data fields in the struct and the functions provided in LL.h and LL.c.
// reverses a linked list
void LL_reverse(LL_t* list);
Test for the Function;
void test_q3() {
LL_t* lst = LLcreate();
LL_add_to_tail(lst, 1);
LL_add_to_tail(lst, 3);
LL_add_to_tail(lst, 8);
LL_add_to_tail(lst, 4);
LL_add_to_tail(lst, 3);
LL_reverse(lst);
intcorrect[] = {3,4,8,3,1};
inti;
node_t* n = lst->head;
for(i=0;i<5;i++) {
if (n==NULL) {
printf("Q3 ERROR: node %d==NULL unexpected\n", i);
return;
}
if (n->data != correct[i]) {
printf("Q3 ERROR: node%d->data==%d, expected %d\n", i, n->data, correct[i]);
return;
}
n = n->next;
}
if (n==NULL)
printf("Q3 ok\n");
}
Support File…
Write a function called mergeLists that takes two call-by-reference argu- ments that are pointer variables that point to the heads of linked lists of values of type int. The two linked lists are assumed to be sorted so that the number at the head is the smallest number, the number in the next node is the next smallest, and so forth. The function returns a pointer to the head of a new linked list that contains all of the nodes in the original two lists. The nodes in this longer list are also sorted from smallest to largest values. Note that your function will neither create nor destroy any nodes. When the function call ends, the two pointer variable arguments should have the value NULL.
Chapter 13 Solutions
Problem Solving with C++ (10th Edition)
Ch. 13.1 - Suppose your program contains the following type...Ch. 13.1 - Suppose that your program contains the type...Ch. 13.1 - Prob. 3STECh. 13.1 - Prob. 4STECh. 13.1 - Prob. 5STECh. 13.1 - Prob. 6STECh. 13.1 - Prob. 7STECh. 13.1 - Suppose your program contains type definitions and...Ch. 13.1 - Prob. 9STECh. 13.2 - Prob. 10STE
Ch. 13.2 - Prob. 11STECh. 13.2 - Prob. 12STECh. 13.2 - Prob. 13STECh. 13 - The following program creates a linked list with...Ch. 13 - Re-do Practice Program 1, but instead of a struct,...Ch. 13 - Write a void function that takes a linked list of...Ch. 13 - Write a function called mergeLists that takes two...Ch. 13 - In this project you will redo Programming Project...Ch. 13 - A harder version of Programming Project 4 would be...Ch. 13 - Prob. 6PPCh. 13 - Prob. 8PPCh. 13 - Prob. 9PPCh. 13 - Prob. 10PP
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
The ____________ is always transparent.
Web Development and Design Foundations with HTML5 (9th Edition) (What's New in Computer Science)
State which of the following are true and which are false. If a statement is false, explain why. Experience has...
C How to Program (8th Edition)
(Count the letters in a string) Write a method that counts the number of letters in a string using the followin...
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
_____ are characters or symbols that perform operations on one or more operands.
Starting Out With Visual Basic (7th Edition)
(Temperature Conversions) Implement the following integer methods: Method celsius returns the Celsius equivalen...
Java How To Program (Early Objects)
Date Printer Write a program that reads a string from the user containing a date in the form mm/dd/yyyy. It sho...
Starting Out with Python (3rd Edition)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that anode of doubly linked list has previous pointer as prev and next pointer as next.void fun(struct node **head_ref){struct node *temp = NULL;struct node *current = *head_ref;while (current != NULL){temp = current->prev;current->prev = current->next;current->next = temp;current = current->prev;}if(temp != NULL )*head_ref = temp->prev;}Assume that reference of head of following doubly linked list is passed to above function 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6. What should be the modified linked list after the function call? Note: solve as soon as possiblearrow_forwardWrite 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.arrow_forwardSuppose you have two objects of Doubly Linked List D1 and D2. Each object is representing a different Doubly Linked List. Write a function to concatenate both doubly linked lists. The concatenation function must return the address of head node of concatenated Doubly Linked List, and it must take two Node* parameters. You need to keep in mind all exceptional cases for example what if either one of the doubly linked lists is empty? Perform this task on paper, take a clear picture of solution and paste it in answer section.arrow_forward
- Question 2: Write a function that takes a list of distinct integers l, and an integer k. Your function then finds the index of the integer in l, whose removal from l results in a list whose sum is k. For example, given [3,6,4,1,5,2] and 18, your function should return index 0, which corresponds to 3 in the list. Because, when 3 is removed from the list, the sum of the remaining list [6,4,1,5,2] is 18. You can assume that the given problem is always solvable. """ def removeOne(l, k):arrow_forwardWrite in C++ Now, what if Sam wants to insert Eevee after Pikachu but he doesn't know where Pikachu is located in his list. Let's help him search for a Pokemon by its name and insert another Pokemon directly after it. Write a function secondPlace() that takes six parameters and inserts a new Pokemon into a list right after another specified pokemon. Once you find the specified Pokemon, use the insertAfter() function from the previous sub-question to add the new Pokemon. The function should return the new number of strings in the array. Note The same Pokemon may appear in the list multiple times (Sam has a bad memory). Assume that Sam wants every instance of the Pokemon he is searching for to be followed by the Pokemon he is attempting to insert. If the array is already full or if the number of strings that are going to be added to the array plus the current number of strings exceeds the total size of the array, the array should remain unchanged. Assume all inputs are lowercase…arrow_forwardIn this coding question for linked lists, you may assume that the list use sentinels or not use sentinels. The choice is yours. but you must pick. If you wish to use sentinel nodes, you must clearly put in a comment before your code that you will be using sentinels. If the statement is not present I will assume you are not using sentinels. Suppose you were given the following declaration for a node and linked list. Every function listed below is a function you can call without implementing. Any function not listed below must be coded by you. class DList{ struct Node{ int data_; Node* next_; Node* prev_; Node(int data = 0, Node* nx=nullptr, Node* pr=nullptr){...} }; Node* front_; Node* back_; public: class const_iterator{ Node* curr_; friend class DList; const_iterator(Node* p){...} public: const_iterator(){...} const_iterator operator++(){...} const_iterator operator++(int){...}…arrow_forward
- Write a function countBottom() that takes a list as parameter, finds and returns the number of bottom values in the list.A bottom value is less than its predecessor and its successor.Assume that the list contains numbers.Example: [4, 2, 3, 7, 6, 6, 4, 3, 5, 8, 6, 7, 5] has 3 bottoms, the first 2, the second 3, and last 6. All these values are less than their predecessor and their successor. can u use pyhton and pls fast answer=)arrow_forwardWrite a function(in pyhton) that takes a list of distinct integers l, and an integer k. Your function then finds the index of the integer in l, whose removal from l results in a list whose sum is k. For example, given [3,6,4,1,5,2] and 18, your function should return index 0, which corresponds to 3 in the list. Because, when 3 is removed from the list, the sum of the remaining list [6,4,1,5,2] is 18. You can assume that the given problem is always solvable.arrow_forward1. Suppose you have already developed an SLL ADT. You have to search a specificelement of the linked list. If you find the element in the list then you have to swapits previous node with its next node. Otherwise, simply print the message “Datanot found”. Now write a function in your SLL ADT with this functionality.arrow_forward
- Please write a full C++ code and provide code and output Two stacks of the same type are the same if they have the same number of elements and their elements at the corresponding positions are the same. Overload the relational operator == for the class linkedStackTypethat returns true if two stacks of the same type are the same; it returns false otherwise. Also, write the definition of the function template to overload this operator.arrow_forwardSuppose a node of a linked list is defined as follows in your program: typedef struct{ int data; struct Node* link; } Node; Write the definition of a function, printOdd(), which displays all the odd numbers of a linked list. What will be the time complexity of printOdd()? Express the time complexity in terms of Big-O notation.arrow_forwardYou 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…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Introduction to Linked List; Author: Neso Academy;https://www.youtube.com/watch?v=R9PTBwOzceo;License: Standard YouTube License, CC-BY
Linked list | Single, Double & Circular | Data Structures | Lec-23 | Bhanu Priya; Author: Education 4u;https://www.youtube.com/watch?v=IiL_wwFIuaA;License: Standard Youtube License