DOUBLE LINKED LIST (DELETION FROM BEGINNING,ENDING AND SPECIFIED POSITION) - DATA STRUCTURES
HTML-код
- Опубликовано: 8 фев 2025
- DOUBLE LINKED LIST DELETION OF AN ELEMENT FROM
1. BEGINNING
2. ENDING
3. SPECIFIED POSITION
---------------------------------------------------------------------------------------------------------------
DATA STRUCTURES
• INTRODUCTION TO DATA S...
JAVA PROGRAMMING
• CORE JAVA TUTORIAL FOR...
COMPILER DESIGN
• INTRODUCTION TO COMPIL...
AUTOMATA THEORY || THEORY OF COMPUTATION
• INTRODUCTION TO AUTOMA...
R PROGRAMMING
studio.youtube...
HTML TUTORIALS WITH IMPLEMENTATION || LEARN HTML IN 4 HOURS
• HTML TUTORIALS WITH IM...
LEARN CSS IN 3 HOURS || CASCADING STYLE SHEETS FOR BEGINNERS
• LEARN CSS IN 3 HOURS |...
JAVA SCRIPT FOR BEGINNERS IN 7 HOURS || LEARN JAVA SCRIPT IN 7 HOURS || JAVA SCRIPT
• JAVA SCRIPT FOR BEGINN...
XML (eXtensible Markup Language)
• XML (eXtensible Markup...
OPERATING SYSTEM
• OPERATING SYSTEM
ETHICAL HACKING
• Video
VI EDITOR BASICS IN LINUX / UNIX || LEARN VI EDITOR COMMANDS || LINUX || UNIX
• VI EDITOR BASICS IN LI...
HOW TO DOWNLOAD & INSTALL MySQL IN WINDOWS 10
• HOW TO DOWNLOAD & INST...
DATABASE MANAGEMENT SYSTEM
• DATABASE MANAGEMENT SY...
PYTHON PROGRAMS
• PYTHON PROGRAMS
C PROGRAMMING
• 01 - VARIABLES & CONST...
CORE JAVA TUTORIAL FOR BEGINNERS || LEARN CORE JAVA IN 15 HOURS || JAVA TUTORIALS FOR BEGINNERS
• CORE JAVA TUTORIAL FOR...
PYTHON TUTORIALS FOR BEGINNERS (తెలుగు లో)
• Learn Python from Scra...
PYTHON OOPS - MODULES - EXCEPTION HANDLING (తెలుగు లో)
• PYTHON - OOPS CONCEPTS...
PYTHON NUMPY TUTORIAL IN TELUGU (తెలుగు లో) || COMPLETE NUMPY TUTORIALS IN TELUGU
• PYTHON NUMPY TUTORIAL ...
PYTHON PANDAS TUTORIAL IN TELUGU (తెలుగు లో) || COMPLETE PANDAS TUTORIALS IN TELUGU || DATA SCIENCE
• PYTHON PANDAS TUTORIAL...
MATPLOTLIB LIBRARY - PYTHON PROGRAMMING (ENGLISH)
• MATPLOTLIB LIBRARY - P...
PYTHON DATABASE CONNECTIVITY - MYSQL & MS-EXCEL
• PYTHON DATABASE CONNEC...
DATA STRUCTURES USING PYTHON (ENGLISH)
• DATA STRUCTURES USING ...
----------------------------------------------------------------------------------------------
Instagram : / sundeepsaradhikanthety
You are such a simple man and hard worker lots of respect sir!!!
Sir,at 17:22 instead of writing temp->next=temp->next->next.why don't we write temp->next=tail
SIR,YOUR VIDEOS ARE VERY HELPFUL FOR ME AND MY CLASSMATES, YOU ARE TEACHING EXACTLY AS TAUGHT BY OUR SIR, LIKE PSEUDO CODE FOR WRITING ALGORITHMS.
Great class sir
Im from kerala
I had a assignment to submited so i just searching for the ans i have viewed several videos but your video is just a blast nothing to say sir awesome class sir hats off
In deletion part i think we have to make node 2 next & prev fields as null. If not the node 2 is still pointing to previous and next nodes. Since it is not free to delete
Null dalo ya free kr lo dono main se null dalke vo node khtm hi smjho kuch bhi kr skte h? I think
7:46 You assumed that list is not empty but after instruction
head = head->next
head may be NULL and
in instruction
head->prev = NULL
you dereferenced NULL ponter which caused segfault
It is tempting to have
if(head==tail)
{
}
as edge case but we should be careful on free behaviour
can u write whole double linked list program
Super and easily understood the concept
Superb explaination
sir u r the best
While disconnect the node-3, you said that we have to update node-2 next reference and node-4 prev reference only. but still node-3 pointing to node-2 and node-3 via next and prev reference of node-3. so it will not eligible for garbage collection it will still remain in the memory because it is pointing to node-2 and node-3.
so could you please elaborate more in that.
Yes
For that bro
temp->next=temp->next->next;
temp->next->next=null;
temp->next->prev=null;
tail->prev=temp;
(I know I have been posted this after a long time U posted question but. I hope it will be useful to next who are watching and referring this chat box for doubts
@@baluvamsikrishna6197 perfect
@@baluvamsikrishna6197thanks bro!
Sir ur videos are helpfull !
Best explained 😊
wow the explanations are really easy to understand , he's sweating really hard btw
Sir I have a question ..... sir u plz complie these pogram .... I can understand ur lecture but .... if u compile these pogram I will be thankful
Amazing
Very Very Thank you sir
Thank you so much ❤️
Thank You Sir I have a question about deleting part for example I have created 3 nodes in run time if I need one node deleted and I added another one but if I deleted all node in the execution time. the program stopped and not allowed to inserting in run time because there is no node to connected and you need to run time and start in another time so how can we solve that problem I need to delete all node in run time and insert in execution time thank you sir
we can give tail -> prev = temp for that instead of temp ->next -> prev = temp no sir for the deleting at specific position
Ya
Excellent sir
Thank you very much sir
Best explanation Sir - your lectures helped me a lot thank you so much 😁
Thankyou sir
U just break the connection after deleting from specific position....
Also tell how to free it
Thank u so much sir
Tq so much sir
Thanks sir
👌👌👌👌👍👍
Sir please make a video on complete code for link lists with functions.
Ok 👌🆗️
I guess the simplest way of deleting Node from beginning should be
var nextNode = this.head.next // storing next Nodefrom head
nextNode.prev = null;
// Make the nextNode prev pointer to null
this.head = nextNode; // change head to next node
👍👍👍👍👍👍
Tsm
Please make video on Linked List implementation using Arrays Plz plz
In the deletion from specified position can't we write tail->prev=temp instead of temp->next->prev=temp !?
consider if it is having 5 nodes, and you want to delete the third element........
tail->prev won't work..... if the nodes are more than 4 nodes....
instead of using temp of prev =null why cant we use temp of next=null. this will disconnect the link !!!!!!
Do while loop is not working sir
Exam me Algorithm yata he sir not implementation so please write Algorithm
SIR IMPLEMENTATIONS
Helpful🤍