List: Difference between revisions
Jump to navigation
Jump to search
| Line 11: | Line 11: | ||
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) can be implemented for a list. | 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) can be implemented for a list. | ||
A '''simply linked list''' has elements that maintain a ''next'' pointer to the next element in the list. The last element's ''next'' pointer contains NULL. | |||
A '''doubly linked list''' has elements that maintain a ''next'' pointer to successor in the list and a ''prev'' pointer to the predecessor in the list. | |||
=Array List= | =Array List= | ||
Revision as of 23:05, 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) can be implemented for a list.
A simply linked list has elements that maintain a next pointer to the next element in the list. The last element's next pointer contains NULL.
A doubly linked list has elements that maintain a next pointer to successor in the list and a prev pointer to the predecessor in the list.