Question

Please answer this programming question as fast as possible. Will upvote

45 pts Question 2 Let BSTree be the following class which implements Binary Search Tree (BST). a. (5 points) Write the method public int maxElement 0 that returns the element of the tree with maximum value if the BST is not empty and returns -1 otherwise. b. (10 points) Write the method public void preOrderPrint 0 that prints out all the elements in the BST in the order of pre-order traversal. c.(15 points) Using a stack of type java.util.Stack (Node), write a method for the class BSTree with signature public int DFSearch (int value). It must perform a Depth-First Search and returns an integer which is equal to: . -1 if it doesn't find a node in the tree with the same data value as the input parameter. - distance of the node with the same data value as the input value from the root; e.g. if the root has the same value, it returns O, if the root's child has the same value, it returns 1, etc. d. (15 points) Write the method public BSTree makeBST (intl postorder) that gets the postorder traversal of a BST as its input parameter, reconstructs the tree and returns it as its output parameter public class BSTree 3 24 3D 20 川! oD F4 F5 F6 F7 F8 F9

Answer 1

a)

CODE

public int maxElement() {

if(root == null) {

System.out.println("Tree is empty");

return -1;

}

//we found the max value

if(root.right == null) {

return root.data;

}

return maxElement(root.right);

}

}

b)

CODE

public void preOrderPrint()

    {

        if (node == null)

            return;

  

        /* first print data of node */

        System.out.print(node.key + " ");

  

        /* then recur on left sutree */

        preOrderPrint(node.left);

  

        /* now recur on right subtree */

        preOrderPrint(node.right);

    }

NOTE: As per HOMEWORKLIB POLICY, I am allowed to answer only 2 coding questions (including sub-parts) on a single post. Kindly post the remaining questions separately and I will try to answer them. Sorry for the inconvenience caused.