How can I get the two furthest leafs in a Binary Search Tree (BST) in Java?

Question

I need to find the two furthest leafs in a Binary Search Tree (BST) in Java. I understand that the tree\'s diameter is the size of the path between them however I do not kno