- [x] Separate chaining hash table as a strategy - [ ] Open addressing strategy - [ ] throw exception in get and search method (BinaryTreeAbstract class) - [ ] binary heap - [ ] create SortedList with doubly linked list - [ ] quicksort method - [ ] searchLast with reduced visibility - [ ] getNodeAt - [ ] addAll - [ ] removeAll - [ ] deleteAll - [ ] set - [ ] subList