Bst Deletion Algorithm Code Example

Example: binary tree deletion

/* This is just the deletion function you need to write the required code. 	Thank you. */  void deleteNode(Node *root, int data) {     if(root == NULL)     {         cout << "Tree is empty\n";         return;     }      queue<Node*> q;     q.push(root);      while(!q.empty())     {         Node *temp = q.front();         q.pop();          if(temp->data == data)         {             Node *current = root;             Node *prev;              while(current->right != NULL)             {                 prev = current;                 current = current->right;             }              temp->data = current->data;             prev->right = NULL;             free(current);              cout << "Deleted\n";              return;         }          if(temp->left != NULL)             q.push(temp->left);         if(temp->right != NULL)             q.push(temp->right);     }      cout << "Node not found for deletion\n"; }