Doubly Linked List - Insertion of a Node ( in Beginning ,End, Given Location) with Java Code #15
Вставка
- Опубліковано 5 жов 2024
- Hey guys! As you all know this channel is all about online programming courses for beginners. So today we have come up with another important topic which is the Insertion of a node in a Doubly Linked List in Data structure using Java. We will learn to insert the new node in doubly linked list at beginning, end, specific location.
Doubly linked list
Doubly linked list insertion
doubly linked list using java
doubly linked list insertion beginning
doubly linked list insertion end
doubly linked list insertion specific location
linklist data structure
linklist using java
linklist in data structure
linklist in data structure java
singly linklist code
intro to linklist
linklist in java
linklist implementation in java
data structure tutorial hindi
data structure for beginners
data structure
data structure tutorial 2021
data structure and algorithm
ugc net computer science preparation
GATE cs coaching classes
cs it youtube channels
c programming tutorials
data structure notes
Timestamp:
01:52 Insertion of a node at beginning of doubly LL (Concept)
13:37 Insertion of a node at beginning of doubly LL (Implementation)
06:06 Insertion of a node at end of doubly LL (Concept)
14:39 Insertion of a node at end of doubly LL (Implementation)
08:55 Insertion of a node at specific location of doubly LL (Concept)
15:35 Insertion of a node at specific location of doubly LL (Implementation)
Link to Data Structure using Java Playlist: • Data Structure using Java
Use my code deepali10 to get 10% discount
Career as a Developer: unacademy.com/...
Reach for the Stars: bit.ly/Unacade...
Link to Data structure using Java Playlist:
• Data Structure using Java
Join the Telegram Group for interview preparation material and updates:
t.me/formyscho...
You can also reach me at:
Instagram: / formyscholarsdeepali
LinkedIn: / formyscholarsdeepali
#formyscholars #DSA #datastructure
For Online/Offline Training & Business Enquiry:
Email-id: formyscholars4u@gmail.com
Disclaimer: The information given in this video is as per my research and knowledge. Kindly do your research also before taking any step to go further.
Get more videos on:
Python full course: ua-cam.com/video/psr7TvtLOxA/v-deo.html
Core java full course: ua-cam.com/video/2qWPpgALJyw/v-deo.html
Django Full course: ua-cam.com/video/ta9kgf15i20/v-deo.html
Swing Full Course: ua-cam.com/video/Tch-CpttcOc/v-deo.html
JavaFx Full course: ua-cam.com/video/8C_gxjuME-8/v-deo.html
JDBC with MySql full course: ua-cam.com/video/7E6-rMlOZ3k/v-deo.html
Android SQLite database full course: ua-cam.com/video/mkNaOm_mWYo/v-deo.html
Android Development Full course: ua-cam.com/video/kZpCnlXcH6Q/v-deo.html
Firebase Full Course: ua-cam.com/video/oPH7rfJel9w/v-deo.html
Topic -wise Core Java Course:ua-cam.com/video/P-EvuYniT5U/v-deo.html
Topic-wise Python Course: ua-cam.com/video/EBe8LMflIsA/v-deo.html
Topic -wise Django Course: --ua-cam.com/video/8qwhXZsP-7Q/v-deo.html
Topic-wise Swing Course: ua-cam.com/video/sjArdR9i1KU/v-deo.html
Topic-wise JavaFx Course: ua-cam.com/video/Vh4Bi0n_-zM/v-deo.html
Topic-wise JDBC Course: ua-cam.com/video/B7MPYTQfs_w/v-deo.html
Placement Preparation Series: ua-cam.com/video/pzTnBNivlmw/v-deo.html
Topic-wise Android Development Series: ua-cam.com/video/4PdsB98p7L4/v-deo.html
Topic-wise Firebase tutorial : ua-cam.com/play/PLH9iLcrNpXtSaTBIsMkxY2ukUEmXn6oYD.html
Very well xplained @ForMyScholars .After heavy research on utube I just found your course and started learning. 💯👏
your teaching method is very good mam you make more vedio thanks
Mam your teaching style is really very easy
Any of the students easily understand
Mam, how to attend product based company interview
Present time I work in service based
company
Please Mam, you suggest me
these videos are very helpful , thankyou mam 💝
Thanks Mam
very very very veryyyyy nice mam
keep doing such great videos mam
Providing kriye Note Mam🌴
So nice teaching mam
tysm mam concept clear 🙏
nice mam
mam in case 3: instead of taking 2-pointers I take 1.
here is the code after loop false.
temp.next.prev = new_node;
new_node.next = temp.next;
new_node.prev = temp;
temp.next = new_node;
It actually works.
This is also correct.
Can you comment here the full source code
mam i have a query , i have one another nethod to use in double ll if we want to add node anywhere in the linked list
for(int i=0;i
loop should run for p-1 and you should use two pointers bro becuase the next node to new_node should have previous pointer as new_node
mam please do provide code link in github or something
Ma'am please provide code !!