Create an application that would use a data stored in a binary search tree. It s

Question

Create an application that would use a data stored in a binary search tree. It should enable a search for a specific element, a traversal of the tree in a specific order, and print all elements in the tree. Project is based on the usage of dynamically allocated memory and linked structures. You may use a logical structure of developed earlier ADT, implemented now as a binary tree.

Project at least includes Application to use tree, BST itself, Node class to store Itemtype data, and a simple Test Driver to run test data. Operations must include insert and delete methods. Use of interfaces is optional but recommended.

Implement the some unit test functionality with mandatory components:
1. input data file and output file for test driver input
2. tests should include cases that may throw exceptions.
3. try and catch have to be included into the program.



I need complete java code

Explanation / Answer

solution: public class BSTNode { private int value; private BSTNode left; private BSTNode right; public BSTNode(int value) { this.value = value; left = null; right = null; } } public class BinarySearchTree { private BSTNode root; public BinarySearchTree() { root = null; } }

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.