Binary Search Tree Manager

Objective:

Students will create a Java program that implements a Binary Search Tree $($BST$).$ The program

will allow users to insert, delete, and search for elements in the BST$,$ as well as display the

tree's structure. This project will introduce students to tree traversal methods and the basic

operations of a BST$.$

NOTE:

$1.$ This is an individual project, and you are expected to complete it independently.

$2.$ Ensure that you clearly include citations and references for any external material or code

you utilize in your project.

Project Description:

In this project, students will implement a Binary Search Tree and provide the following

functionality:

$1.$ Insertion: Add elements to the BST following BST rules.

$2.$ Deletion: Remove elements from the BST$,$ handling all three deletion cases $($no child,

one child, two children$).$

$3.$ Search: Search for a specific element in the BST$.$

$4.$ Traversal: Implement in$-$order, pre$-$order, and post$-$order traversal methods.

$5.$ Tree Visualization: Print the tree structure in a readable format.

Core Components:

$1.$ Node Class:

$$ Define a Node class that represents each element of the tree. The Node should

store:

$$ A value $($integer$).$

$$ References to its left and right children.

$2.$ Binary Search Tree Class:

$$ Create a BinarySearchTree class that:

$$ Allows insertion, deletion, and searching of elements.

$$ Has methods to perform in$-$order, pre$-$order, and post$-$order traversal.

$$ Prints the tree's structure in a readable format $($e$.$g$.,$ using indentation$).$

$3.$ Insertion:

$$ Insert elements into the BST based on standard BST rules.

$4.$ Deletion:

$$ Implement a method to delete nodes from the tree. The method should handle:

$$ Leaf node deletion.

$$ Nodes with one child.