Notes

Linked lists, stacks, and Queues:

Array = data structure
+ quick to access to anywhere in the array due to predictable memory location
+All in contagious memory locations
(you might have to declare the array of size 100 for example)
The basic array is static 0 always have to declare the memory you need
-Inefficient use of memory if requirements can't be predicted before run-time
-Can't expand beyond size set at run-time
Changing item order can be slow and inefficient

Linked List:
> A data structure that consists f a sequence of data records such that in each record there is a field that contains a reference (i.e. a link) to the next record/value in the list
> (flexible)Order of the linked items may be different from the idea that the data...

ListNode consists of an integer called element and a ListNote called node, which references the next node in the list.

Operations with Linked List
> add a new node at the end
> add a new node after specified node
> delete last node
> delete specified node

Pseudo-code - adding
> start at the head node
> follow references along list
> when reference = null, reached tail node
> create a new list node
> set reference portion of old tail node to address of new list node
> set references portion of new list node

Pseudo-code - deleting
> start at head node
> follow references along list
> follow the chain, find last node, tail node
> step back one place to previous node, just change it to null
the old tail still will exist in memory, but cannot be reached by following reference chain for linked list

Array Overheads:
> Os must store the array name, the data type of the data stored, and the address of the first cell of the array

Stacks
(also a type of list, a little bit more restricted)
> The main restriction of stack, the elements can only be inserted and removed from one end.
> Two types, static version of stack and dynamic
storage:
>store a number of elements in order of arrival
>elements accessed in a Last-In-First-Out (LIFE) order
operations:
>push - add element to the stack or something like that
>pop
Using stacks:
>Moving elements in an out from a single end means that stacks are

Need to know about queues