How do I implement a BST tree using Java? Please see screenshot.

For this lab, you will be implementing a basic BST Data Structures The tree node should be of the following type: Public class BSTNode Int data BSTNode left BSTNode right; //I constructor You have to perform three operations on the BST tree: Insert a node into the BST while preserving the BST characteristic namely: the left sub tree of the node is always less than (in value) the right sub tree Delete a node from the BST by handling the following cases o the node to be removed is a leaf o the node to be removed has one child o the node to be removed has two children Print: This function should begin by printing a small header containing the size of the tree. Then it should perform an InOrder traversal of the tree, printing out each element as it traverses the tree