About this Assignment In this course, you have learned about trees in data structure, binary trees, and binary search trees. For this assignment, you will develop an application using the Java programming language. Assignment Prompt The application must address the following requirements: NP N S Include a user interface allowing a user to interact with the binary search tree. When a user runs the application, it displays a menu and prompts the user to select an option. The menu options are: Create a binary search tree Add a node Delete a node Print nodes by InOrder Print nodes by PreOrder Print nodes by PostOrder Exit program When a user selects 1) Create a binary search tree, the application creates a binary search tree with the given data (1, 2, 3, 4, 5, 6, 7). When a user selects 2) Add a node, the application prompts the user to input a value for the new node. The application needs to insert the value to the existing binary search tree. When a user selects 3) Delete a node, the application prompts the user to input the value of the node that will be deleted. The application needs to delete the node. When a user selects 4) Print nodes by InOrder, the application prints the nodes of the current binary search tree by traversing it using in-order traversal. When a user selects 5) Print nodes by PreOrder, the application prints the nodes of the current binary search tree by traversing it using pre-order traversal. When a user selects 6) Print nodes by PostOrder, the application prints the nodes of the current binary search tree by traversing it using post-order traversal. When a user selects 7) Exit program, the application ends