Circular Linked List Data Structure with all Operations & Algorithm | Part 1 | DSA

preview_player
Показать описание
Support Simple Snippets by Donations -
--------------------------------------------------------------------------------------------- In this video tutorial we will understand the working of Circular Linked List & see all operations of Circular Linked List. We will study how Circular Linked List works and see exactly what happens in the memory when we perform the singly linked list operations.
We will also understand the approach that we will be using in our implementation by taking a brief explanation of the code snippet which will write in the next video (Part - 2) of this topic.
Following are the standard Linked List Operations -
1. Traversing a linked list.
2. Append a new node (to the end) of a list
3. Prepend a new node (to the beginning) of the list
4. Inserting a new node to a specific position on the list
5. Deleting a node from the list

Simple Snippets Official Website -
Simple Snippets on Facebook -
Simple Snippets on Instagram -
Simple Snippets on Twitter -
Simple Snippets Google Plus Page -
Simple Snippets email ID -

#circularlinkedlist #linkedlist #linkedlistdatastructure #datastructures #linkedlistds #linkedlistoperations
Рекомендации по теме
Комментарии
Автор

Hey Guys, if you want more such tech educational videos on this channel then please support me by subscribing to this channel & also share it with your friends as it helps me create more content just for you ✌

SimpleSnippets
Автор

That "OK, SO THIS WAS THE..." at the end of video 31:27 explains your hardwork and passion . Thank you so much for your HARDWORK and TIME.

penguin
Автор

This guy can "traverse" knowledge to others. Talented professor. Thanks man ! 10/10

rocketleague
Автор

A lots of thanks to you very sir. You clear my all doubt related to link list .
There is no video in youtube which can teach better than you.
Thank

parashmoniboruah
Автор

Sir, this video was very comprehensive as all of your other videos. I'm so glad that I found your channel and you on YouTube. Thank you for the efforts that you put in to make such quality videos for us and that too for free of cost. You're so down to earth and it's very hard to see people like you. May God bless you! 😘💖

gokulnaathb
Автор

Superb teaching Skills! If given an opportunity, I would give you millions of subscribers in Guru Dakshida!

adityatiwari
Автор

You have earned yourself a new subscriber. Thank you so much Tanmay!

suhaskanamadi
Автор

these lectures are so good- thanks for all the hardwork with the videos- helped so much

NikitaSharma-bsgg
Автор

thx a lot man you give me understand in this lecture

ffann
Автор

you r so so good ... your teaching skills r lit ... helping me a lot in understanding DSA ... Respect from PAKISTAN <3

Romana-uwss
Автор

One of the best videos I have ever scene..

normalpeople
Автор

Great video man! Just one suggestion, you can try deleting the nodes rather than just unlinking them. Would save memory.

manavpatnaik
Автор

nice explanation . This shows the clarity of concepts .

Shaillha
Автор

while deleting the node if we had checked for the key provided exist or not in the list why are we checking if head is their or not? I think its already covered in search for key condition. Btw Nice work.

anuraggupta
Автор

what is the use of circular linked list over single or doubly linked list?

paul
Автор

Can you please add video of doubly linked circular link list.

NimishP
Автор

can you please tell one thing while deleting we just delink the current not but not delete it wont it cause a memory leak if this program runs again and again. and how should we delete the node from memory as well.

MillandeepSingh
Автор

What's the software you use for handwriting the notes in the video? I also wanted to start a channel that's why I wanted to know

mohammadfaizanazim