A compilation of data structures & various CS concepts ( complexity, useful objects, etc.) I've worked on throughout through-out college. Below is a list of all material covered.
- Stacks
- Queues
- Linked Lists (SLL)
- Binary Trees (btree)
- Binary Search Trees (BSTs)
- Treaps (Implemented using BSTs)
- Huffman Trees
- Hash Tables (hashes)
- Binary Numbers || (Using ArrayLists & Arrays)
- A simulated Rolodex (rolodex) || (Using 2 way LinkedLists)
- An Anagram checker (anagrams) || (Using HashTables)
- A simulated GroceryStore w/customers || (Using LinkedLists & Queues)
- SelectionSort (Algorithms)
- BubbleSort (Algorithms)
- QuickSort (Algorithms)
- MergeSort (Algorithms)
- TreeTraversal (BSTs && HuffmanTree)
- Various examples of complexity analysis (complexity)