void delete (Node *p, Node *n) // Delete node pointed to by n. 248 249 250 // Parameters: 251 // points to node to be deleted 252 // points to parent of node to be deleted. 253 { 254 // Deletion has 3...

Context: This code is for a binary search tree and there's no input

Extracted text: void delete (Node *p, Node *n) // Delete node pointed to by n. 248 249 250 // Parameters: 251 // points to node to be deleted 252 // points to parent of node to be deleted. 253 { 254 // Deletion has 3 cases - no subtrees, only left or right subtree, or both 255 // left and right subtrees. 256 Node *deleteNode = n; → // Save copy of pointer to node to delete. 257 258 if (n->leftChild != NULL) { I/ there is left child 259 260 // your code goes here <«>< 261="" 262="" }="" else="" if="" (n-="">rightChild) { →→|/ there is a right child 263 264 // your code goes here 265 266 } else {- → >// no children 267 // your code goes here «««««« 268 < 269="" 270="" }="" 271="" 272="" }//delete()="">


Extracted text: 4.2.3 Add delete() function You will implement a function to delete a node from the tree. In this part, you are required to implement the delete function in tree. It gets called by the withdraw function. The delete function has the following signature: void delete (Node* p, Node *n); The delete function takes in two nodes, p and n, wherep is the parent of node n. withdraw has already been implemented. Hint: Refer to lecture slides to refresh your memory on the different cases that you must deal with when removing a node from a binary tree.