Today i learned basics of linked list. Where i learned about head tail how it works. As it start at the head and moves to the next index if we give .next. Today i started with the basic topics like reverse linked list and also middle node. As i started sorting yesterday i though of completing it as i have only one more concept it is quick sort. I also did this quick sort here we will part them and swap them and do a quick sort.
Quick sort:
As for linked list first we should assign a value to none and other one to head and while coding we will update the none value and return it in reverse linked list. Then in middle node linked list we will just assign the head value to the next and next.next the loop will run until their is no number after the present number. I was so happy today to learn about linked list.
Reverse Linked List:
Top comments (0)