Binary Search Tree implementation
BST implementation;
1- insertion;
2- find
3- next grater elemeent;
4- delete element;
**best part-: implemeted using node swap ;
NOTE- implemented "DELETE operation " using node swapping not by value swapping hence root value is not allowed to delete;