Implement a method that accepts parameters for an IntTree and minimum and maximum integer values, and removes from the tree any elements that are not within that range $($inclusive$).$

For this method, you should assume that your tree is a binary search tree $($BST$),$ so its elements are in valid BST order. Your method should maintain the BST ordering property of the tree.