This project provides a basic, generic implementation of a tree data structure in Java. It is based on a guided lab designed to teach the fundamentals of trees, including how to represent hierarchical ...

- 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 - ...