This program cover Binary search trees for six buttons Insert, Delete, Inorder, Preorder, Postorder, and Breadth-First. The tree traversal buttons: The Inorder, Preorder, Postorder, and Breadth-first buttons each display a message that will list the tree elements.
This is how the element will be deleting the root from the tree and the easy way to do that is to move one step to the left after that it will go to the right as much as it can.
This is how it looks after deleting the element number 60 .
How to Run
1- You can run the code with any Java compiler.
2- For people who do not want to look at the code I create an application called "BST.exe" so, that you can run the program without looking at the code:
This is how it look
If your computer does not have Java program or have old Version
The file require you to have a java runtime 1.8.0
After when you click "OK" it will take you to the java website to download the program
Program "Running the Code without compiler"
Feel free to Emile me if you have any question.