Circular Singly Linked List (Insertion at the Beginning)

preview_player
Показать описание
Data Structures: Insertion at the Beginning of a Circular Singly Linked List
Topics discussed:
1) C program for inserting a new node at the beginning of a circular singly linked list.

Music:
Axol x Alex Skrindo - You [NCS Release]

#DataStructuresByNeso #DataStructures #CircularLinkedList #LinkedList
Рекомендации по теме
Комментарии
Автор

02:38 And how can we have a tail pointer?
For knowing this, look at the addToEmpty() [Named as circularSingly() in the last lecture] function of this lecture.
Notice these points :
1. addToEmpty() function is returning the Tail pointer!
How? how the function is returning the Tail pointer?
- Because that pointer's next part is pointing to the first node of the list, therefore, that pointer is Tail!
2. Thus, by the Tail pointer we can easily complete our tasks and reduce the time complexity.
And in this lecture, the addAtBeg() function is also returning the Tail pointer.
How or why?
- Because the pointer that it is returning whose next part is pointing to the first node of the list.

Thanks :)
I love Neso Academy.

dipeshsamrawat
Автор

Thank you for providing the content. Most of my clg exams are aced by your videos only.

srinivasvoore
Автор

Tomorrow is my exam and your video helped me a lot. जय श्री कृष्ण सर।

k_aesthetic
Автор

Sir Ur content is very helpful
But plzz upload lectures regularly 🙏🙏....

DeepakKumar-nkcv
Автор

Impressive from the beginning to the end!
Thx U guys for providing a wonderful platform to learn ALL these amazing knowledges!!!

沼氨
Автор

Exceelent sir, in this programme I have learned the importance of function, that we haven't work more on main function but we simply distribute our work in small small parts, this is one of my favourite Lecture, you are great sir

.abhishekkumar
Автор

I am so happy you have 1MILLION subscribers!! :D XD

Dnsx_plus
Автор

Dear Neso Academy , Please reply what is the difference between datastructures and advanced datastructures?

monicabattacharya
Автор

Wrong, line number 38
Struct node * tail = head;

NitinReddy-iwll
Автор

but pls upload how we take input from the user

devanshchauhan
Автор

In 11th line of prgrm there is malloc(sizeof(struck node))
What does malloc mean what does it do ?

universalstarcpu
Автор

Sir, can you give complet source code single Linked list, double linked list and circular linked list

nageegundala
Автор

what about the head pointer? newnode added at beginning, its address should be updated to head ?

aramvijay
Автор

Sir here u take only one one node .if we have to insert node to more then one node I mean list ...how to insert to list using tail
.

ashwathbb
Автор

sir how to makes notes out of your videos ?are you providing one in your app?or do i take screenshot and make a pdf or handwritten?

utkarshlath
Автор

realy helping can we have algorithm also ?

raimasoni
Автор

Please upload trees🙏
My exam is from 28

tatsuyashiba
Автор

Sir please assure me, I am from NON- CS background.Is your content enough for gate cse?do i need to practise anything apart from previous years gate papers after fully understanding and memorising your content?

utkarshlath
Автор

U didn't explained how to insert to circular linked list with more than 2 elements...

shreepadabhat
Автор

newnode->link = tail->link;
tail->link = newnode;
this isn't work forme
but this works for me
newnode->link = head;
tail->link = newnode;
head = newnode;
can anyone say why didn't that works for me ?

aravindks