Binary Tree Creation: Write a Java program to create a binary tree with at least 8 nodes. Allow the user to input values for the nodes and build the binary tree. Traversal Operations: Implement methods for in-order, pre-order, and post-order traversals of the binary tree. Print the result of each traversal. Search Operation: Implement a method to search for a specific key in the binary tree. Allow the user to input a key and display whether it exists in the tree or not. Binary Search Tree Operations: Modify the program to enforce the binary search tree property. Implement methods to add a node to the binary search tree. Implement methods to delete a node from the binary search tree. Display Tree Structure: Implement a method to display the structure of the binary tree (not in any specific order). Use proper indentation to represent the hierarchy of nodes