public class MyTree{

private TreeNode root; public MyTree(){ root=null; } public void remove(int data){ if (root == null) return false; else{ if (root.getValue() == value) {

BSTNode auxRoot = new BSTNode(0);

auxRoot.setLeftChild(root);

boolean result = root.remove(value, auxRoot);

root = auxRoot.getLeft();

return result;

} else {

return root.remove(value, null); } } public void printReverse(){ //implement this method to print data in descending order } public void display(){ //implement to display the tree structure } public boolean isEmpty(){ return root==null;} public int size(){ return sizeHelper(root); } private int sizeHelper(TreeNode node){ if(node==null) return 0; else return 1+sizeHelper(node.getLeft())+sizeHelper(node.getRight()); } public boolean search(int data){ return searchHelper(root, data); } private boolean searchHelper(TreeNode node, int data){ if(node==null) return false; if(node.getData()==data) return true; else if(node.getData()

Question: I'm not sure how to implement the printReverse method and display the tree form.

Could you show me the methods please? Thanks!