Comparing the LL and AR Implementation
- you can overflow the array-based quack, but not the linked-list based quack
- do you remember why?
- (may of course create an 'artificial' maximum number of nodes for the linked-list version)
- a
struct _node in a linked list implementation stores a quack element
- a
struct _node in an array-based implementation stores the whole array
- the head node of the linked list version points to the top of the quack node
|