//key operation on binary search tree class GfG { static class node { int key; node left, right; } static node root = null ; //A utility function to //create a new BST node static node newNode( int item) { node temp = new node(); temp.key = item; temp.left = null ; temp...