List: Difference between revisions
Jump to navigation
Jump to search
| Line 9: | Line 9: | ||
=Linked Lists= | =Linked Lists= | ||
A '''linked list''' is a data structure implementing a [[Data Structures#Dynamic_Set|dynamic set]] in which the elements are arranged in a linear order. The order is determined by pointers maintained by elements to other elements in the list. All [[Data Structures#Dictionary|dictionary]] operations (INSERT, DELETE, SEARCH, PREDECESSOR, SUCCESSOR, etc.) can be implemented for a list. | |||
=Array List= | =Array List= | ||
Revision as of 23:01, 11 August 2018
Internal
Overview
A list is an implementation of a dynamic set.
Linked Lists
A linked list is a data structure implementing a dynamic set in which the elements are arranged in a linear order. The order is determined by pointers maintained by elements to other elements in the list. All dictionary operations (INSERT, DELETE, SEARCH, PREDECESSOR, SUCCESSOR, etc.) can be implemented for a list.