Answered: Write a method called inversePrint.…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Write a method called inversePrint. This method gets a head of a linkedlist and Recursively print from the last item to the first one.

This is a Recursive method. If Recursive is not used you will get no mark for this question
Do not reverse the linkedlist, only print it in reverse

example call:

in the main I will call your method like:

buffer = myList.head; //This is a buffer to copy the head address

inversePrint(buffer);

After this, the order for myList should not changed.
if myList has: 1->2->3->4->5
your function should print: 5-> 4 -> 3->2->1
but if I check myList the order should still be 1->2->3->4->5
you can assume the LinkedList code for all other operations exist and if you need you can use them
Do Not create a new linkedlist in inverse
Hint: use recursion does this for you really easy

Expert Solution

Step by step

Solved in 4 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

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