Insert a Node at the Tail of a Linked List [HackerRank] | Data Structure | LinkedList | Interview

preview_player
Показать описание
This video is about HackerRank Insert Node at the Tail of a Linked List
You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty.

#HackerRank #DataStructure #LinkedList

Linear Linked List in detail

For 1 : 1 Tutoring
WhatsApp contact : 7278222619

Follow me on:
Whatsapp:

Facebook:

Linkedin:

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

Thank you so much this problem really spins my head that how I can insert a new node outside the class.

yashpandey
Автор

still having a hard time understanding why we return head. head isn't being changed, ptr is? So why does appending something new to the end of ptr change what head looks like?

raabaahmad
Автор

Thank you 😊, There is one problem in Hacker rank " new year chaos" can you please upload video by performing it in a best simple way.

KumarRaj-ljit
Автор

Sir, how to add node at any specific position in a linked list?

SourabhKumar-qgtg