Open Tanyajain2006 opened 3 hours ago
Reversing the linked list in singly, circular singly, doubly and circular doubly linked list.
@Tanyajain2006 @pankaj-bind Please assign this to me . I would Like to work on this.
@Tanyajain2006 @pankaj-bind Please assign this to me . I would Like to work on this.
Hi Ritika, Thank you for your offer to contribute! I really appreciate it. However, I’ve already completed this part of the project. When the project admin assigns, I just need to create a pull request. I hope you understand, and I’ll definitely keep you in mind for future tasks!
Thanks
Issue will be closed if:
Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.
Name: Reversing the linked list
[NEW ALGORITHM]
About:
Reversing the linked list basically wants to reverse the links of node by keeping the position of nodes same. ex- 1->2->3->4->5->NULL after reversal: NULL<-1<-2<-3<-4<-5
Labels:
new algorithm, gssoc-ext, hacktoberfest, level1
Assignees: