subject: data structure & algorithms java recommend

Q8 (10pts): Given a binary search tree, write an instance method between(...) that takes a lower bound lower and an upper bound upper and returns a HashSet containing all of the data elements x in the tree between lower and upper, inclusive. To add an elementx to the HashSeth, use h.add(x). import java.util.HashSet; class TreeNode { E value; TreeNode left; TreeNode right; HashSet between (Comparable lower, Comparable upper) { // Your Code