How to solve$-$ with working code for this project and picture of outcome.

Comp $282$ Fall $2024$: Project $1$ Binary Search Tree

Program a binary search tree $("$BST$")$ in Java by implementing the interface given below.

public interface BinaryTree$$ E extends Comparable bst$.$insert $("$apple$")$

bst$.$insert $("$mangrove$")$;

bst$.$insert $("$ignore$")$;

bst$.$display$()$;

mangrove mango igloo horse dog cat apple

system.out.println$("$horse height is: $"+$bst$.$treeHeight$())$;

The height of the BST is: $4$

system.out.println$("$horse height is :$"+$bst$.$itemHeight $("$horse$")),$

horse height is: $3$

system.out.println$("$The height of the left subtree of horse is$"+$ bst$.$leftHeight $("$horse$"))$;

The height of the left subtree of horse is : $-1$

sysetem.out.println $("$The height of the right subtree of horse is: $"+$bst$.$rightHeight $("$horse$"))$;

The height of the right subtree of horse is: $2$