Question: c++ Code that that take in a linked list called called list and reverse that linked list and returns a revList. Without using recursion for
c++ Code that that take in a linked list called called list and reverse that linked list and returns a revList. Without using recursion
for example
list = 1->2->3->NULL
revLIst = NULL -> 3 -> 2 -> 1
please explain what happens at each step
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
