Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //metoda pomocnicza do znajdywania najmniejszej wartosci w poddrzewie
- Node *minKey(Node *cnode) {
- Node *curr = cnode;
- while (curr && curr->left != nullptr)
- curr = curr->left;
- return curr;
- }
- //metoda pomocnicza do usuwania wierzchołka
- //znajdujemy nastepnik w poddrzewie, kopiujemy wartosc do wezla i usuwamy zastepce
- Node *usunxd(T value, Node *cnode) {
- if (cnode == nullptr)
- throw invalid_argument("nie ma takiej wartosci w drzewie");
- if (value < cnode->key)
- cnode->left = usunxd(value, cnode->left);
- else if (value > cnode->key)
- cnode->right = usunxd(value, cnode->right);
- else {
- if (cnode->left == nullptr) {
- Node *temp = cnode->right;
- cnode->right = nullptr;
- delete cnode;
- return temp;
- } else if (cnode->right == nullptr) {
- Node *temp = cnode->left;
- cnode->left = nullptr;
- delete cnode;
- return temp;
- }
- Node *temp = minKey(cnode->right);
- cnode->key = temp->key;
- cnode->right = usunxd(temp->key, cnode->right);
- }
- return cnode;
- }
- //metoda usuwania
- void usunWezel(T value) {
- if (this->node == nullptr)
- throw invalid_argument("drzewo jest puste");
- else
- node = usunxd(value, this->node);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement