void BinarySearchTree::find(int d)
{
     //Locate the element
    bool found = false;
    if(isEmpty())
    {
        cout<<" This Tree is empty! "<<endl;
        return;
    }
    tree_node* curr;
    tree_node* parent;
    curr = root;
    while(curr != NULL)
    {
         if(curr->data == d)
         {
            found = true;
            cout << " Item " << d << " found" << endl;
 
            break;
         }
         else
         {
             parent = curr;
             if(d>curr->data) curr = curr->right;
             else curr = curr->left;
         }
    }
    if(!found)
   {
        cout << " " << d <<" Data not found! "<<endl;
        return;
    }
    if((curr->left == NULL && curr->right != NULL)|| (curr->left != NULL
&& curr->right == NULL))
    {
       if(curr->left == NULL && curr->right != NULL)
       {
           if(parent->left == curr)
              parent->left = curr->right;
           else
              parent->right = curr->right;
       }
       else // left child present, no right child
       {
          if(parent->left == curr)
            parent->left = curr->left;
          else
            parent->right = curr->left;
 
       }
     return;
    }
 //We're looking at a leaf node
 if( curr->left == NULL && curr->right == NULL)
 {
        if(parent->left == curr) 
             parent->left = NULL;
        else parent->right = NULL;
            return;
 }
    //Node with 2 children
    // replace node with smallest value in right subtree
  if (curr->left != NULL && curr->right != NULL)
  {
        tree_node* chkr;
        chkr = curr->right;
        if((chkr->left == NULL) && (chkr->right == NULL))
        {   
            curr = chkr;
            curr->right = NULL;
        }
        else // right child has children
        {
            //if the node's right child has a left child
            // Move all the way down left to locate smallest element
            if((curr->right)->left != NULL)
            {
                tree_node* lcurr;
                tree_node* lcurrp;
                lcurrp = curr->right;
                lcurr = (curr->right)->left;
                while(lcurr->left != NULL)
                {
                   lcurrp = lcurr;
                   lcurr = lcurr->left;
                }
  curr->data = lcurr->data;
                lcurrp->left = NULL;
           }
           else
           {
               tree_node* tmp;
               tmp = curr->right;
               curr->data = tmp->data;
               curr->right = tmp->right;
            }
        }
  return;
    }