List Data Structure

What is List? ,[object Object],[object Object]

List operations ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Illustration/example ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Illustration/example ,[object Object],List’s contents Return value 1. Initialiaze(L) <empty> - 2. Add(0,A,L) A - 3. Add(0,B,L) B A - 4. Add(1,C,L) B C A - 5. Set(1,N,L) B N A - 6. Add(1,D,L) B D N A - 7. Remove(A,L) B D N A 8. Set(3,I,L) B D N I - 9. Remove(D,L) B N I D 10. Remove(N,L) B I N

Exercise: List Operation ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Storing a list in a static data structure (Array List) ,[object Object],[object Object],[object Object],[object Object],[object Object]

Storing a list in a dynamic data structure (Linked List) ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Adding a node  The new node is to be added at a specified index in the list ,[object Object],Another special case is that the specified index is 0 (the node is to be added at the front of the list ).

Adding a node (2) ,[object Object],[object Object],If the new node is to be added at the end of the list, then the NextNode of the last element is set to refer to the new node.

Adding a node (3)  A possible algorithm (pseudocode) for the Add operation ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Additional operations can also be implemented to add to the beginning and end of the list. AddFirst (Data, LinkedList) calls Add(0, Data, LinkedList) AddLast (Data, LinkedList) calls Add(Size, LinkedList), where Size is itself a call to the Size operation of the list.

Removing a node ,[object Object],[object Object],In the general case, an object reference Probe moves through the list until the required node is reached – at each node the current node (Probe) is compared with TargetNode. A Previous object reference is also required to keep track of the predecessor of the node to be removed. A special case is when both references point to the same node – this happens when the first node is to be deleted. To delete the current node we can set Previous.NextNode to be equal to Probe.NextNode.

Accessing nodes (Get, Set, IndexOf, View) ,[object Object],[object Object],[object Object]

Variations on Linked Lists ,[object Object],[object Object],Doubly linked lists These permit scanning or searching of the list in both directions. (To go backwards in a simple list, it is necessary to go back to the start and scan forwards.) In this case, the node structure is altered to have two links: Sorted lists Lists can be designed to be maintained in a given order. In this case, the Add method will search for the correct place in the list to insert a new data item.

List Implementation in Java ,[object Object],[object Object],[object Object],[object Object],[object Object]

List Implementation in Java ,[object Object]

List Data Structure

Recomendados

Recomendados

Más contenido relacionado

La actualidad más candente

La actualidad más candente (20)

Destacado

Destacado (20)

Similar a List Data Structure

Similar a List Data Structure (20)

Más de Zidny Nafan

Más de Zidny Nafan (6)

Último

Último (20)

List Data Structure