Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- node* find(node* start, int key, (node*)& previous) {
- if (start == NULL) {
- return NULL;
- }
- if (key == start->key) {
- return start;
- }
- else {
- if (key > start->key) {
- return find(start->r, key, start);
- }
- if (key < start->key) {
- return find(start->l, key, start);
- }
- }
- }
- void delete(int key) {
- node* previous = NULL;
- node* element_for_delete = find(root, key, previous);
- if (element_for_delete == NULL) {
- return;
- }
- node* smallest_of_big = element_for_delete->r;
- while (smallest_of_big->l != NULL) {
- smallest_of_big = smallest_of_big->l;
- }
- smallest_of_big->l = element_for_delete->l;
- if (previous != NULL) {
- if (previous->key > (element_for_delete->r)->key) {
- previous->l = element_for_delete->r;
- }
- else {
- previous->r = element_for_delete->r;
- }
- }
- delete element_for_delete;
- }
Advertisement
Add Comment
Please, Sign In to add comment