Please enable JavaScript.
Coggle requires JavaScript to display documents.
Abstract Data Types and Data Structures + Lists, Stacks, and Queues -…
Abstract Data Types and Data Structures + Lists, Stacks, and Queues
-
Lists
-
enqueue: last-insert (top,v)
-
A list is said to be empty when it contains no elements. The number of elements currently stored is called the length of the list. The beginning of the list is
called the head, the end of the list is called the tail
-
Linked Lists
The second traditional approach to implementing lists makes use of pointers and is
usually called a linked list
-
Element Implementations
List users must decide whether they wish to store a copy of any given element on
each list that contains it