69 CS651 Lecture : DSA notes 33

6 views2 pages

Document Summary

L33: doubly linked list in java | lesson 33 | dsa. This video is part of a new playlist on data structures and algorithms in java by coding ninjas. in this video, we will learn about how to make a doubly-linked list. different operations. Some advantages and disadvantages and some problems. the previous pointer of the head will point to null. to make a doubly-linked list. I "ll have to connect the new node to the tail. So i left we "ll keep track of the tail as well. So let"s make two variables as head, which will initially be null and tail, which will also be initially being done Let "s say i pass one, three, five, seven and nine and now the values will also must be printed in this manner only in this order, so let "s try to run this suppose. I pass 5, 1, 3, 5, 7, 9 and 9 to print this yes.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

Related Questions