Reverse a linked list using recursion [HackerRank] | Data Structure | LinkedList | Interview

preview_player
Показать описание
This video is about Reverse a LinkedList using Recursion.
Problem Statement:
You’re given the pointer to the head node of a linked list. Change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty.

#HackerRank #DataStructure #LinkedList
Problem:
Code Sample:
def reverse(head):
return head
return p1

For 1 : 1 Tutoring
WhatsApp contact : 7278222619

Follow me on:
Whatsapp:

Facebook:

Linkedin:

Instagram:
Рекомендации по теме
Комментарии
Автор

Best video for recursively reversing a linked list

chenpeng
Автор

There are many videos on this topic, but your video above all with the dry run. Thank you sir for taking your time out and explaining this.

souravchakraborty
Автор

Absolutely great video! It helped me a lot

lukasweber
Автор

Great explanation .. but @ 10:34 head = 12 and next is 13 and the next of 13 is null. Please can you explain more, how head.next.next is pointing to 12

damilareoyebanji
Автор

Hey Programmer, if you enjoyed this video checkout   my latest video hhttps://youtu.be/lBVAznAZ39A of Alphabet Rangoli problem from HackerRank and don't forget to like, comment, subscribe and share with others.

codingcart
visit shbcf.ru