Please answer the question. Thanks.

2. BST Write a Java program that implement Binary Search Tree (BST). Nodes of the tree is from the input of users. INPUT The first line contains the number of nodes of the tree. Next is the input of the elements for the nodes. The input only cover Integer only. OUTPUT Print the inorder, postorder and preorder traversal of the tree. Input 7 65 23 43 Output Inorder: 9 11 12 23 43 65 67 Postorder: 9 11 12 43 23 67 65 Preorder: 65 23 12 11 9 43 67 67