- find successors and predecessors using BST (both list will be sorted); in the end, we can easily get top k from the two sorted list - with BST: **inorder traversal gives us sorted predecessors - ...

This project was built as part of my Java developer learning roadmap. The program uses parallel arrays to store employee names, salaries, and days worked. It loops through the records, skips employees ...