CIS 313 Winter 1997
Data Structures
Homework Assignment #3
- 7.16
- 7.24(a)
- Define an implementation of a linear list allowing for constant
time access, insertion and deletion on either end of the list,
reversal and concatenation operations. Provide a description for each
of the operations. (In terms of primitive list operators, succ and
pred, concatenation of two lists A and B is defined as
succ(last(A))==pred(first(B)). )
- 11.2
- 11.3(c) ((a) and (b) for extra credit)