Data structures
àDynamic data structures
Stacks
E.g. Used to store return addresses for procedures or functions (recursion)
LIFO- Last in First Out
If the stack is full then an overflow error occurs
Queues
Eg printer queues
They are circular
LILO- Last In Last Out
No comments:
Post a Comment