How to Reverse a Linked List? | Iterative + Recursive | Java Placement Course

01:24 - Iterative
12:50 - Recursive

[aarishfaiz]

Mam You are Really the best Instructor, Really your way makes DSA very easy Hope I will Meet you some day to say this to you.

[manjushapatade]

these sessions help me a lot to learn java..hats up guys

[vivekbhore]

thanks a lot
need more videos on bst, graphs, implementations and algorithms :)

[sameerhussain]

mam thank you so much for this wonderful course . i studied my whole DS course from your videos . mam sending you a lot of love from Pakistan.

[nasimaaktar]

Thank you, mam.If you can please make videos on advanced java. your lecture was very helpful to me.

[sindhujamaram]

Very nice explanation didi, please continue the java placement series (trees, graphs).

[kanailalmanna]

Thank you so much Aman bhaiya, Shradha di and all team members

[nn_yt]

THE BEST TEACHER
THE BEST CONTENT
JUST GRATEFUL ❤️

[susheellattala]

for (int i =list.size()-1; i >= 0 ; i--) {
int temp=list.get(i) ;
list.addLast(temp);
list.remove(i);
}
System.out.println(list);
//this is also working in Single ended Linked list

[itsfunnytime]

❤️❤️ you dii bss aap jldi jldi video uploaded kro please 🙏🙏

[hareeshkumar]

Thank you Ma'am.
Make a complete playlist on python please.
Your way of teaching is very nice.
Rather than others.

[vaibhavjadhav]

Plz Make video session on data structure question..it will clear all remaining doubt.

[shamsher]

Linked List bahut good laga
Thanks you so much didi ❤️❤️😗

[onlineworld]

Didi I i really inspired from your videos

[uchihaPrincessSakura]

Didi nice explanation of Reverse a linked list

[plutomessi]

Thank you so much didi watched alot of videos, asked my friend but still was confused
Thank you again 🙏

[rajeshgoudkatnam]

If you create a node( nextNode) in the loop for each iteration . May be Space complexity will be O(n)

[sanjaykumar-bb]

If you initiate your currentNode from head, then there is no need to check corner cases for an empty list or a list with only one element

public static void reverseLLIteratively(){
Node previousNode = null;
Node currentNode = head; // Starts from the head of the list
Node nextNode ;

while (currentNode != null){
nextNode = currentNode.next; // Store the next node in the list
currentNode.next = previousNode; // Reverse the pointer

// update
previousNode = currentNode; // Update the previous node
currentNode = nextNode; // Move to the next node
}
head = previousNode; // Update the head to the new start of the reversed list
}

[shwetanksudhanshu]

very nice explanation..please continue this series again

[Yogitmamania-]

mam next time agr aap reverse link list pr vedio bnaye toh pls orginal link list jese dikhti hain na like boxes proper or address dale hue hote hain pls proper manner main smjhna kyunki thoda typical tpoic lgta h mujhe ye thoda understanding bhi deeply ho jati hain orginal linklist se may be