PPT Slide

NODE_PTR delete(NODE_PTR t, int x){

if (t==NULL) return NULL;

if (x < t->info){

t->left = delete(t->left,x);

return t;

} else if (x > t->info){

t->right = delete(t->right,x);

return t;

} else { /* found x */

if (t->left == NULL) return t->right;

else if (t->right == NULL) return t->left;

else { /* has two children */

NODE_PTR suc = deleteSuc(t);

suc->left = t->left;

suc->right = t->right;

return suc;

}