Ordered Linked Lists

Ordered linked lists are discussed in this chapter. The insert method is created by carefully looking at inserting in the middle, end, and beginning of a linked list, as well as in an empty list. The delete method is examined and is left as an exercise. Doubly linked lists as well as an inner class...

Full description

Saved in:
Bibliographic Details
Published inGuide to Data Structures pp. 135 - 172
Main Authors Streib, James T, Soma, Takako
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2018
Springer International Publishing
SeriesUndergraduate Topics in Computer Science
Online AccessGet full text

Cover

More Information
Summary:Ordered linked lists are discussed in this chapter. The insert method is created by carefully looking at inserting in the middle, end, and beginning of a linked list, as well as in an empty list. The delete method is examined and is left as an exercise. Doubly linked lists as well as an inner class are introduced and the complete program implements a list of user defined objects.
ISBN:9783319700830
3319700839
ISSN:1863-7310
2197-1781
DOI:10.1007/978-3-319-70085-4_6