PREV INDEX NEXT

Author: Unknown
Subject: Deque implementation
Date: Thursday, 19 Mar 2020, 04:32:33

If we use the implementation of the deque where a deque is headed (ie. the deque is always a struct that comprises 2 fields (H and T), even when empty), then is it true that *d will never change for the functions declared in Deque.c/Deque.h? Are there any possible cases we should think about for when *d may change?

Furthermore, is there any disadvantage to using this implementation? The spec and your answers above seem to suggest that your implementation of deque may be better.
PREV INDEX NEXT