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 <-->6If 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: templatevoid LinkedBag::test_function(){Node* temp = nullptr;Node* current = headPtr;while (current != nullptr){temp = current->getPrev();current->setPrev(current->getNext());current->setNext(temp);current = current->getPrev();}if(temp != nullptr )headPtr = temp->getPrev();}

explination: the test function is just reversing the linked list ..... you can clearly obser in the this below image...

Answered: C++ Consider the following function as…

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...

See similar textbooks

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();
}

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

Assume a linked list contains following integers: 2, 2, 4, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a=0; Node<int> *aNode; while(curNode->getItem()<7){ aNode=curNode; curNode=curNode->getNext(); } a=aNode->getItem(); A. 5 B.8 C.0 D.7
Stack: Stacks are a type of container with LIFO (Last In First Out) type of working, where a new element is added at one end and (top) an element is removed from that end only. Your Stack should not be of the fixed sized. It should be able to grow itself. bool empty() : Returns whether the Stack is empty or not. Time Complexity should be: O(1) bool full() : Returns whether the Stack is full or not. Time Complexity should be: O(1)int size() : Returns the current size of the Stack. Time Complexity should be: O(1)Type top () : Returns the last element of the Stack. Time Complexity should be: O(1) void push(Type) : Adds the element of type Type at the top of the stack. Time Complexity should be: O(1) Type pop() : Deletes the top most element of the stack and returns it. Time Complexity should be: O(1) Write non-parameterized constructor for the above class. Write Copy constructor for the above class. Write Destructor for the above class. Now write a global function show stack which…

Recommended textbooks for you

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 Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

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 Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

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

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS