Given a binary search tree and a number, write a Java program to remove all nodes that are less than the number. (All I need is the method that removes everything less than the number) I can assume the Binary search tree has a working remove method, however I want to find a more efficient way of doing this, rather than calling remove on every node less than the number..