Please help! // TreeNode.javaclass TreeNode<T> {T item;TreeNode<T> leftChild;TreeNode<T> rightChild;public TreeNode(T newItem) {// Initializes tree node with item and no children.item = newItem;leftChild = null;rightChild = null;} // end constructorpublic TreeNode(T newItem,TreeNode<T> left, TreeNode<T> right) {// Initializes tree node with item and// the left and right children references.item = newItem;leftChild = left;rightChild = right;} // end constructor} // end TreeNode // BinaryTreeBasis.javapublic abstract class BinaryTreeBasis<T> {protected TreeNode<T> root;public BinaryTreeBasis() {root = null;} // end default constructorpublic BinaryTreeBasis(T rootItem) {root = new TreeNode<T>(rootItem, null, null);} // end constructorpublic boolean isEmpty() {// Returns true if the tree is empty, else returns false.return root == null;} // end isEmptypublic void makeEmpty() {// Removes all nodes from the tree.root = null;} // end makeEmptypublic T getRootItem() throws TreeException {// Returns the item in the tree's root.if (root == null) {throw new TreeException("TreeException: Empty tree");}else {return root.item;} // end if} // end getRootItempublic abstract void setRootItem(T newItem);// Throws UnsupportedOperationException if operation// is not supported.} // end BinaryTreeBasis public interface GameTree {789.10111213141516171819202122public void startGame(String question, String yesAnswer, String noAnswer);// Starts playing the game by creating a game tree of three nodes.// The root contains the question, the root's left child contains the yesAnswer,// and the root's right child contains the noAnswer.// Precondition: question is the question to ask.////// Postcondition: A minimal game tree is created.// Throws: None.yesAnswer is the answer to the question for yes.noAnswer is the answer to the question for no.public void newRound();// Starts a new round of the game.// Precondition: A game tree exists.// Postcondition: Current position in the game tree is (re)set to the root.// Throws: None.232425public void endGame();// Ends the game.// Precondition: None.// Postcondition: A message is printed to indicate end of game.// Throws: None.2627282930313233public void moveYes() throws TreeException;// Moves to next step if the user answers yes.// Precondition: None.// Postcondition: None.// Throws: TreeException is thrown if not able to move to next step.343536public void moveNo() throws TreeException;// Moves to next step if the user answers no.// Precondition: None.// Postcondition: None.// Throws: TreeException is thrown if not able to move to next step.3738394041424344454647484950515253545556575859public String getQuestion() throws TreeException;// Obtains current question from the game tree.// Precondition: Current node should contain a question.// Postcondition: Current question is returned.// Throws: TreeException is thrown if not able to get question.public void setQuestion(String question, String answer);// Sets the question provided by the player into the game tree.// Precondition: question is the question entered by the player.//// Postcondition: The question and answers are set up correctly.// Throws: None.answer is the correct answer provided by the player.public String getAnswer() throws TreeException;// Obtains current answer from the game tree.// Precondition: Current node should contain an answer.// Postcondition: Current question is returned.// Throws: TreeException is thrown if not able to get answer.60616263646566 }67public boolean isQuestion();// Checks if current node is question node// Precondition: None.// Postcondition: Returns true if current node is question node.// Throws: None. 1. Implement an ADT GameTree that extends the abstract class BinaryTreeBasis providedin the textbook.2. Separate the implementation of ADT GameTree from its interface.3. Develop the application (i.e., a driver program) that uses the ADT GameTree to solvethe problem.4. The following files are provided, and it is required that they have to be used:GameTree.java: The game tree interfaceBinaryTreeBasis.java: from the textbookTreeNode.java: from the textbookTreeException.java: from the textbook5. You are not allowed to modify the files provided to you except adding packageinformation if used.6. Only methods specified in the interface can be declared public in the implementation.Any other auxiliary method in the implementation should be declared private.7. In summary, all you need to develop are two java files:The implementation of the interface that also extends the tree's base classThe application (driver) program that contains a loop to play the game until quit.TestingTest the following test casesYES YESYES NONO YESNO NOYES YES (again, just in case)NO YES (again, just in case)YES NO YESYES N ΝΟΝΟ ΝΟΥESNO NO NOo Design a test case with at least 4 YES's or NO's

Actually, A binary tree is a tree data structure in which each node at most children, which are…

Please help! // TreeNode.java class TreeNode { T item; TreeNode leftChild; TreeNode rightChild; public TreeNode(T newItem) { // Initializes tree node with item and no children. item = newItem; leftChild = null; rightChild = null; } // end constructor public TreeNode(T newItem, TreeNode left, TreeNode right) { // Initializes tree node with item and // the left and right children references. item = newItem; leftChild = left; rightChild = right; } // end constructor } // end TreeNode // BinaryTreeBasis.java public abstract class BinaryTreeBasis { protected TreeNode root; public BinaryTreeBasis() { root = null; } // end default constructor public BinaryTreeBasis(T rootItem) { root = new TreeNode(rootItem, null, null); } // end constructor public boolean isEmpty() { // Returns true if the tree is empty, else returns false. return root == null; } // end isEmpty public void makeEmpty() { // Removes all nodes from the tree. root = null; } // end makeEmpty public T getRootItem() throws TreeException { // Returns the item in the tree's root. if (root == null) { throw new TreeException("TreeException: Empty tree"); } else { return root.item; } // end if } // end getRootItem public abstract void setRootItem(T newItem); // Throws UnsupportedOperationException if operation // is not supported. } // end BinaryTreeBasi

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE