Data Structures & Algorithms in Java: Doubly & Circular Linked Lists
Java SE 13
| Intermediate
- 8 Videos | 42m 4s
- Includes Assessment
- Earns a Badge
Discover how to implement the linked list in Java, including the doubly linked list and the circular linked list, and learn how to perform operations on these linked lists. In this course, you'll explore variations on the singly linked list that you covered earlier. You'll see how the doubly linked list holds an additional reference to the previous node in the linked list along with a reference to the next node. This means additional space is required to store each node, but it also makes certain operations faster, such as traversing backwards over the elements in the linked list. You'll also learn about the circular linked list, where the tail of the linked list points back to the head of the linked list.
WHAT YOU WILL LEARN
-
discover the key concepts covered in this courseinsert a new node at the head and tail of a doubly linked listinsert a new node at any index position in a doubly linked listdelete a node from a doubly linked list
-
traverse a doubly linked list from the last element to the firstinsert a new node in a circular linked listcount nodes and delete nodes in a circular linked listsummarize the key concepts covered in this course
IN THIS COURSE
-
1.Course Overview1m 56sUP NEXT
-
2.Insertion at Head and Tail of Doubly Linked List9m 9s
-
3.Insertion at Specified Index of Doubly Linked List5m 23s
-
4.Deleting a Node of a Doubly Linked List7m 2s
-
5.Printing Backwards with Doubly Linked Lists1m 53s
-
6.Inserting a Node in a Circular Linked List7m 2s
-
7.Counting & Deleting Nodes in a Circular Linked List8m 26s
-
8.Course Summary1m 14s
EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE
Skillsoft is providing you the opportunity to earn a digital badge upon successful completion of this course, which can be shared on any social network or business platform
Digital badges are yours to keep, forever.