What's a data structure
Arrays
Circular
Linked list
Queues
Arrays (Normal and Circular)-
Normal:
CTRL+ALT+7 Text Code.
Instead of a Normal Array this goes from the start index to the end index which are also initialized when used
Start Index= 0 and is incremented when an element is removed
End Index= 0 and is incremented when an element is added
If Either modulated with the length of the array = 0 then they are reset back to 0.
Insertion: O(1)
PS is O(n) if resize needed
Deletion: O(1)
Random Access: O(1)
These are the singles elements of a linked list containing:
Data
Reference to the either the next item in the list or NULL if the end