Advantages of linked lists
The greatest advantages of linked lists are that they are easy to understand and implement, and they are generic enough that they can be used in many different situations. This means that they can be used to model many different kinds of data, starting from single values and going up to complex data structures with many fields. Additionally, linked lists are really fast at sequential searching when used with pointers.
Linked lists not only help you to sort your data, but they can also assist you in keeping your data sorted even after inserting or deleting elements. Deleting a node from a sorted linked list is the same as in an unsorted linked list; however, inserting a new node into a sorted linked list is different ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access