69 CS651 Lecture : DSA notes 31

5 views2 pages

Document Summary

L31: singly linked list in java | lesson 31 | dsa in. So head is a very important value for us. a node class and we have created our node as well. Now we will see how different operations we can perform on the linked list. The first node of a linked list is known as head and tail If i want to insert a new node or to connect a node. One thing i can do is that i can traverse through head. I will go to this node, then this node Let "s see other operation that we can also do on the linked list. So let "ssee other operation. we "ll pass the head of the link list to the head and update the tail to the next position. Head is here now and position is 1 right now we "ll just break off from the while loop and connect the new. node 88.

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