in java

Create a new project to build a Binary search tree , and do the following:

1-Add all the needed methods to process the BST (including : add, remove, search, and inorder traversal)

2- Locate the smaller element in the left subtree, and print it.

3- Add the following method to display the nodes in a breadth-First traversal :

public void BFT()

Edit: I believe the public void bft() is just the method he wants us to use or label as for the bread-first traversal.