Stacks, queues, lists, trees, dynamic sets, pointers and objects, rooted trees, asymptotic analysis.
Gain further practice in algorithm analysis through examination of stacks, queues, lists, and trees.
Stacks, queues, linked lists, pointers and objects, rooted trees.
Textbook 21 pages
Provide four implementations of the Dynamic Set ADT and compare their performance.
Programming