[Solved]Java Programming Write Binary Search Tree Scratch Without Using Code Source Need Recreate Q37116011

Java Programming

Write a Binary SearchTree from scratch, without using any code from any other source.You do not need to recreate the interfaces used in the book; youmay write all the code in a BST < T extends Comparable<T>> class. Use a linked binary tree structure as described inlecture 9. Your BST does not need to be an AVL tree or any otherkind of balanced tree; it is OK if it becomes unbalanced withcertain input.

This week, create thegeneric Node < T extends Comparable <T>> class, anadd() method that takes a T as its parameter, creates a Node, andadds it to the tree, a get() method that takes a data value andreturns a reference to a Node, and a method called showAll(), whichshould use inorder traversal to print the toString() of each datavalue in the tree (note that this will print the data values inorder from least to greatest.) Write either JUnit tests or a driverclass that adds some values to the BST and then uses the showAll()to print out the values from the tree.

Expert Answer

---

Answer to Java Programming Write a Binary Search Tree from scratch, without using any code from any other source. You do not need … . . .