C++ Consider the following function as a property of a LinkedBag that contains a Doubly Linked List.  Assume a Node has pointers prev and next, which can be read and changed with the standard get and set methods.   Assume that the doubly linked list is: 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6 If you are uncertain what the above diagram depicts, it is a doubly linked list such that: The head of this doubly linked list is the node that contains the value 1. The tail of this doubly linked list is the node that contains the value 6. The 3rd node in this list contains the value 3. The contents of this list are the values 1 through 6 in sequential order.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

C++

Consider the following function as a property of a LinkedBag that contains a Doubly Linked List. 

Assume a Node has pointers prev and next, which can be read and changed with the standard get and set methods.

 

Assume that the doubly linked list is:

1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6

If you are uncertain what the above diagram depicts, it is a doubly linked list such that:

  • The head of this doubly linked list is the node that contains the value 1.
  • The tail of this doubly linked list is the node that contains the value 6.
  • The 3rd node in this list contains the value 3.
  • The contents of this list are the values 1 through 6 in sequential order.

The following questions are regarding the linked list after after the test_function is run.

A. The head of the list after the test_function is run contains the value:      B. The tail of the list after the test_function is run contains the value:      

C. The 3rd node in the list after the test_function is run contains the value:

template<class ItemType>
void LinkedBag<ItemType>::test_function()
{
Node<ItemType>* temp = nullptr;
Node<ItemType>* current = headPtr;
while (current != nullptr)
{
temp = current->getPrev();
current->setPrev(current->getNext());
current->setNext(temp);
current = current->getPrev();
}
if(temp != nullptr )
headPtr = temp->getPrev();
}
Transcribed Image Text:template<class ItemType> void LinkedBag<ItemType>::test_function() { Node<ItemType>* temp = nullptr; Node<ItemType>* current = headPtr; while (current != nullptr) { temp = current->getPrev(); current->setPrev(current->getNext()); current->setNext(temp); current = current->getPrev(); } if(temp != nullptr ) headPtr = temp->getPrev(); }
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY