LINKED LIST PROBLEMS
The solutions to the linked list problems that follow can be implemented in any language that supports dynamic memory, but because you rarely implement your own linked lists in languages like Java and C#, these problems make most sense in C.
Stack Implementation
This problem is designed to determine three things:
- Your knowledge of basic data structures
- Your ability to write routines to manipulate these structures
- Your ability to design consistent interfaces to a group of routines
A stack is a last-in-first-out (LIFO) data structure: elements are always removed in the reverse order in which they were added, much in the same way that you add or remove a dish from a stack of dishes. The add element and remove element operations are conventionally...