Implement findTopK() method on Binary Search Tree with a return class of ArrayList in Java

To find top k items by counts requires another method of the class BST, findTopK() with a non negative integer parameter. Find top k values in the BST. @param k a non negative integer @return a sorted collection of top k values in this BST public ReturnClass findTopK( int k)