Write a Java program to create a Binary Search Tree (where each key is greater than the keys in its left subtree and smaller than the keys in its right subtree).

Once the binary tree has been constructed write a function to reverse the binary search tree created in the earlier step. Reverse BST (where each key is smaller than the keys in its left subtree and greater than the keys in its right subtree)