Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void tree_delete(int value) {
- nodeptr*tree_search(&root, value);
- if (nodeptr->left=NULL&&nodeptr->right=NULL){
- *nodeptr= NULL;
- }
- else if (nodeptr->left!=NULL&&nodeptr->right=NULL){
- *nodeptr=nodeptr->left;
- }
- else if (nodeptr->left=NULL&&nodeptr->right!=NULL){
- *nodeptr=nodeptr->right;
- }
- else{
- maxnodeptr*tree_maximum(nodeptr->left);
- nodeptr->key= maxnodeptr->key;
- *maxnodeptr=maxnodeptr->left;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement