JAVA: Adding the following methods per a Binary Search Tree: ~void insert(int key) - inserts a node in the binary search tree (BST) ~void postorder(Node node) - post-order traversal of BST ~void inorder(Node node) - in-order traversal of BST ~void preOrder(Node node) - pre-order traversal of BST ~boolean search(int key) - checks whether a given key exists in BST ~int minValue(Node root) - finds the smallest element in BST ~void deleteKey(int key) - deletes a node from BST