grigory51

delete

May 22nd, 2012
29
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.01 KB | None | 0 0
  1. node* find(node* start, int key, (node*)& previous) {
  2.         if (start == NULL) {
  3.                 return NULL;
  4.         }      
  5.         if (key == start->key) {
  6.                 return start;
  7.         }
  8.         else {
  9.                 if (key > start->key) {
  10.                         return find(start->r, key, start);
  11.                 }
  12.                 if (key < start->key) {
  13.                         return find(start->l, key, start);
  14.                 }
  15.         }
  16. }
  17. void delete(int key) {
  18.     node* previous = NULL;
  19.     node* element_for_delete = find(root, key, previous);
  20.     if (element_for_delete == NULL) {
  21.         return;
  22.     }
  23.     node* smallest_of_big = element_for_delete->r;
  24.     while (smallest_of_big->l != NULL) {
  25.         smallest_of_big = smallest_of_big->l;
  26.     }
  27.     smallest_of_big->l = element_for_delete->l;
  28.     if (previous != NULL) {
  29.         if (previous->key > (element_for_delete->r)->key) {
  30.             previous->l = element_for_delete->r;
  31.         }
  32.         else {
  33.             previous->r = element_for_delete->r;
  34.         }
  35.     }
  36.     delete element_for_delete; 
  37. }
Advertisement
Add Comment
Please, Sign In to add comment