• Used linear list to hold multiple cash values inputted. Implemented search, add, remove, view, and print functions.
• Used binary search tree to hold multiple cash values inputted. Implemented breadth-first, post-order, post-order, and in-order traversals along with search, insert, delete, and print functions.
• Used a pseudorandom hashing sequence to input multiple cash values into a hashtable. Also implemented a collision resolution along with search, insert, delete, and print functions.