Question

Using the concept of singly linked list, show all the pointer updates required for the following Operation (show steps hy using starting 6 chancters of your full name): head 10.pico, Bormes R

Answer 1

The algorithm for above changes in asmo follows: * We have to reverse the singly linked list Algorithm: → Take thace pointer of type Node of singly Unked list Namely pueve NULL, A 981 head, and next =NULL" Here pres means pointed to the previous node and curr = current node initialized with head of list as next as null. while (curs != null) next = curl next curr next = Prev curo - next es Pre = curor an head=prev 50, Head I s cures S HM] fjst iteration head cror! null su mendo next LIM S prev مولودية

head 1 NM - I head M HAHNEL 서 So, the Loop buealkj and iteration: V next A A Prev curr 3rd iteration : next A L T Prey C서 4th iteration head next V. S NH Pere Tour coor 5th iteration head nent V T prev S AK MKAK next = null curl = null and finally head = prev. A HAE M A 9 oth iteration head 왜 야 - N a prev head S A font
if you have any problem let me know I will try to solve that.