12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229 |
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- typedef enum {
- _tree_h_black,
- _tree_h_red
- } _tree_h_color_t;
-
-
- template <class Key, class Data> class TreeNode {
- public:
-
-
-
- TreeNode(Key key, Data data) {
- SetColor(_tree_h_red);
- SetData(data);
- SetKey(key);
- SetParent(NULL);
- SetLeft(NULL);
- SetRight(NULL);
- }
-
-
-
- ~TreeNode() {
- TreeNode<Key, Data> *left;
- TreeNode<Key, Data> *right;
- left = GetLeft();
- right = GetRight();
- SetParent(NULL);
- SetLeft(NULL);
- SetRight(NULL);
- if (left) {
- left->SetParent(NULL);
- delete left;
- }
- if (right) {
- right->SetParent(NULL);
- delete right;
- }
- }
-
-
-
- void SetColor(_tree_h_color_t color) {
- _color = color;
- }
-
-
-
- _tree_h_color_t GetColor() {
- return _color;
- }
-
-
-
- TreeNode<Key, Data> *GetChild() {
- return GetLeft();
- }
-
-
-
- void SetChild(TreeNode<Key, Data> *tree) {
- Left(tree);
- }
-
-
-
- TreeNode<Key, Data> *GetLeft() {
- return _left;
- }
-
-
-
- void SetLeft(TreeNode<Key, Data> *tree) {
- if (tree == this)
- return;
- _left = tree;
- if (tree)
- tree->SetParent(this);
- }
-
-
-
- TreeNode<Key, Data> *GetSibling() {
- return GetRight();
- }
-
-
-
- void SetSibling(TreeNode<Key, Data> *tree) {
- SetRight(tree);
- }
-
-
-
- TreeNode<Key, Data> *GetRight() {
- return _right;
- }
-
-
-
- void SetRight(TreeNode<Key, Data> *tree) {
- if (tree == this)
- return;
- _right = tree;
- if (tree)
- tree->SetParent(this);
- }
-
-
-
- Data GetData() {
- return _data;
- }
-
-
-
- void SetData(Data data) {
- _data = data;
- }
-
-
-
- Key GetKey() {
- return _key;
- }
-
-
-
- void SetKey(Key key) {
- _key = key;
- }
-
-
-
- TreeNode<Key, Data> *GetParent() {
- return _parent;
- }
-
-
-
- void SetParent(TreeNode<Key, Data> *parent) {
- _parent = parent;
- }
-
-
-
-
- void PrintNode() {
- cout << "(" << _key << ", " << _data << ", "
- << ((GetColor() == _tree_h_red) ? "Red" : "Black")
- << ")";
- }
-
-
-
- void PrintInorder() {
- if (_left) {
- _left->PrintInorder();
- cout << endl;
- }
- PrintNode();
- if (_right) {
- cout << endl;
- _right->PrintInorder();
- }
- }
-
-
-
-
- void PrintNodeSpecial(void (*print_func_k)(Key), void (*print_func_d)(Data)) {
- printf("(");
- if (print_func_k)
- (*print_func_k)(_key);
- printf(", ");
- if (print_func_d)
- (*print_func_d)(_data);
- printf(", %s)", ((GetColor() == _tree_h_red) ? "Red" : "Black"));
- }
-
-
-
- void PrintInorderSpecial(void (*print_func_k)(Key), void (*print_func_d)(Data)) {
- if (_left) {
- _left->PrintInorderSpecial(print_func_k, print_func_d);
- printf(",\n");
- }
- PrintNodeSpecial(print_func_k, print_func_d);
- if (_right) {
- printf(",\n");
- _right->PrintInorderSpecial(print_func_k, print_func_d);
- }
- }
-
-
-
- TreeNode<Key, Data> *SearchByData(Data data, bool *error) {
- TreeNode<Key, Data> *tree = NULL;
- *error = true;
- if (_data == data) {
- *error = false;
- return this;
- }
- if (_left)
- tree = _left->SearchByData(data, error);
- if (_right && !tree)
- tree = _right->SearchByData(data, error);
- return tree;
- }
-
-
-
- TreeNode<Key, Data> *SearchByKey(Key key, bool *error) {
- *error = false;
- if (_key == key) {
- return this;
- } else if (_left && key < _key) {
- return _left->SearchByKey(key, error);
- } else if (_right) {
- return _right->SearchByKey(key, error);
- } else {
- *error = true;
- return 0;
- }
- }
-
-
-
- void Insert(TreeNode<Key, Data> *tree) {
- if (!tree || tree == this) {
- return;
- }
- if (tree->GetKey() < _key) {
- if (!_left) {
- SetLeft(tree);
- } else {
- _left->Insert(tree);
- }
- } else {
- if (!_right) {
- SetRight(tree);
- } else {
- _right->Insert(tree);
- }
- }
- }
-
- private:
- _tree_h_color_t _color;
- Key _key;
- Data _data;
- TreeNode<Key, Data> *_left;
- TreeNode<Key, Data> *_right;
- TreeNode<Key, Data> *_parent;
- };
-
-
- template <class Key, class Data> class Tree {
- public:
-
-
-
- Tree() {
- _error = false;
- _num_elements = 0;
- _root = 0;
- }
-
-
-
- ~Tree() {
- Clear();
- }
-
-
-
- unsigned int NumElements() {
- return _num_elements;
- }
-
-
-
- Data SearchByKey(Key key, bool *error) {
- TreeNode<Key, Data> *seeking;
- *error = true;
-
-
- if (!_root)
- return 0;
-
- seeking = _root->SearchByKey(key, error);
-
- if (seeking)
- return seeking->GetData();
-
- return 0;
- }
-
-
-
- Key SearchByData(Data data, bool *error) {
- TreeNode<Key, Data> *seeking;
- *error = true;
-
-
- if (!_root)
- return 0;
-
- seeking = _root->SearchByData(data, error);
-
- if (seeking)
- return seeking->GetKey();
-
- return 0;
- }
-
-
-
- void Insert(Key key, Data data) {
- TreeNode<Key, Data> *tree = new TreeNode<Key, Data>(key, data);
- ++_num_elements;
-
- if (_root) {
- _root->Insert(tree);
- RestoreRedBlackAfterInsert(tree);
- } else {
- _root = tree;
- _root->SetColor(_tree_h_black);
- }
- }
-
-
-
- bool RemoveByData(Data data) {
- bool error = true;
- if (_root)
- Remove(_root->SearchByData(data, &error));
- return error;
- }
-
-
-
- bool RemoveByKey(Key key) {
- bool error = true;
- if (_root) {
-
-
- error = false;
- while (!error) {
-
- Remove(_root->SearchByKey(key, &error));
-
- }
-
- }
- return error;
- }
-
-
-
- void Erase() {
- Clear();
- }
-
-
-
- void Clear() {
- if (_root)
- delete _root;
-
- _num_elements = 0;
- _error = false;
- _root = 0;
- }
-
-
-
- Data operator [] (Key key) {
- _error = false;
-
- if (_root)
- return SearchByKey(key, &_error);
-
- _error = true;
- return 0;
- }
-
-
-
-
- void PrintTree(TreeNode<Key, Data> *tree, unsigned int height,
- unsigned int seek, bool rightmost) {
- TreeNode<Key, Data> *left, *right, *parent;
-
- if (!tree)
- return;
-
- parent = tree->GetParent();
-
- if (height == seek) {
- if (!parent) {
- cout << endl << "[height " << height << "] " << endl;
-
- if (tree->GetColor() == _tree_h_red)
- cout << "*";
- } else {
- if ((parent->GetColor() == _tree_h_red) && (tree->GetColor() == _tree_h_red))
- cout << "*";
- }
-
- cout << "(" << tree->GetKey() << ", "
- << ((tree->GetColor() == _tree_h_red) ? "red" : "blk")
- << ")";
-
- if (rightmost) {
- cout << endl << "[height " << (height+1) << "] " << endl;
- PrintTree(_root, 0, ++seek, true);
- } else {
- cout << " ";
- }
-
- return;
- } else if (seek < height) {
- return;
- }
-
- left = tree->GetLeft();
- right = tree->GetRight();
- ++height;
-
- if (left) {
- PrintTree(left, height, seek, false);
- } else {
- cout << "(-, blk) ";
- }
-
- if (right) {
- PrintTree(right, height, seek, rightmost);
- } else {
- cout << "(-, blk) ";
- }
-
- if (parent) {
- if (parent->GetRight() != tree) {
- cout << " | ";
- }
- }
- }
-
-
-
- void PrintAsTree() {
- PrintTree(_root, 0, 0, true);
- cout << endl << "Nodes marked with * are in error" << endl;
- }
-
-
-
- void Print() {
- cout << "Tree: " << _num_elements <<" elements {" << endl;
- if (_root) {
- cout << "Root: ";
- _root->PrintNode();
- cout << endl;
- _root->PrintInorder();
- }
- cout << endl << "}" << endl;
- }
-
-
-
-
- void PrintSpecial(void (*print_func_k)(Key), void (*print_func_d)(Data)) {
- printf("Tree: %u elements {\n", _num_elements);
- if (_root && print_func_k && print_func_d) {
- printf("Root: ");
- _root->PrintNodeSpecial(print_func_k, print_func_d);
- printf("\n");
- _root->PrintInorderSpecial(print_func_k, print_func_d);
- }
- printf("\n}\n");
- }
-
-
-
- Key Root() {
- if (_root) {
- return _root->GetKey();
- }
- return 0;
- }
-
-
-
- bool Error() {
- return _error;
- }
-
- bool IsValidRedBlackTree() {
- return IsValidRedBlackTreeCheck(_root, true);
- }
-
- private:
-
- TreeNode<Key, Data> *GetSuccessor(TreeNode<Key, Data> *tree)
- {
- TreeNode<Key, Data> *successor;
-
-
- successor = tree->GetRight();
-
- if (successor)
- {
- while (successor->GetLeft())
- {
- successor = successor->GetLeft();
- }
-
- return successor;
- }
- else
- {
- successor = tree->GetParent();
-
- while (tree == successor->GetRight())
- {
- tree = successor;
- successor = successor->GetParent();
- }
-
- if (successor == _root)
- {
- return NULL;
- }
-
- return successor;
- }
- }
-
-
- TreeNode<Key, Data> *GetPredecessor(TreeNode<Key, Data> *tree)
- {
- TreeNode<Key, Data> *predecessor;
-
-
- predecessor = tree->GetLeft();
-
- if (predecessor)
- {
- while (predecessor->GetRight())
- {
- predecessor = predecessor->GetRight();
- }
-
- return predecessor;
- }
- else
- {
- predecessor = tree->GetParent();
-
- while (tree == predecessor->GetLeft())
- {
- if (predecessor == _root)
- {
- return NULL;
- }
-
- tree = predecessor;
- predecessor = predecessor->GetParent();
- }
-
- return predecessor;
- }
- }
-
-
- bool IsValidRedBlackTreeCheck(TreeNode<Key, Data> *current, bool valid)
- {
- TreeNode<Key, Data> *right, *left;
- _tree_h_color_t color_red;
-
- if (!current)
- {
- return valid;
- }
-
-
- if (!current->GetParent() && current->GetColor() == _tree_h_red)
- {
- return false;
- }
-
- color_red = (current->GetColor() == _tree_h_red);
- left = current->GetLeft();
- right = current->GetRight();
-
-
- if (left)
- {
- if (color_red && left->GetColor() == _tree_h_red)
- {
- return false;
- }
-
- if (!IsValidRedBlackTreeCheck(left, valid))
- return false;
- }
-
- if (right)
- {
- if (color_red && right->GetColor() == _tree_h_red)
- {
- return false;
- }
-
- if (!IsValidRedBlackTreeCheck(right, valid))
- return false;
- }
-
- return true;
- }
-
-
- void RotateLeft(TreeNode<Key, Data> *tree)
- {
- TreeNode<Key, Data> *right, *right_leftchild, *parent, *uncle;
-
-
- if (!tree || !_root)
- {
- return;
- }
-
-
- right = tree->GetRight();
-
-
- right_leftchild = NULL;
-
- if (right)
- {
- right_leftchild = right->GetLeft();
- }
-
-
- tree->SetRight(right_leftchild);
-
-
- if (right_leftchild)
- {
- right_leftchild->SetParent(tree);
- }
-
-
- if (right)
- {
- right->SetParent(tree->GetParent());
- }
-
-
- parent = tree->GetParent();
-
- if (parent)
- {
- uncle = parent->GetLeft();
-
-
- if (tree == uncle)
- {
- parent->SetLeft(right);
- }
- else
- {
- parent->SetRight(right);
- }
- }
- else
- {
- _root = right;
- }
-
- if (right)
- {
-
- right->SetLeft(tree);
-
- if (tree)
- {
- tree->SetParent(right);
- }
- }
- }
-
-
- void RotateRight(TreeNode<Key, Data> *tree)
- {
- TreeNode<Key, Data> *left, *left_rightchild, *parent, *uncle;
-
-
- if (!tree || !_root)
- {
- return;
- }
-
- left = tree->GetLeft();
-
- left_rightchild = NULL;
-
- if (left)
- {
- left_rightchild = left->GetRight();
- }
-
- tree->SetLeft(left_rightchild);
-
- if (left_rightchild)
- {
- left_rightchild->SetParent(tree);
- }
-
- if (left)
- {
- left->SetParent(tree->GetParent());
- }
-
- parent = tree->GetParent();
-
- if (parent)
- {
- uncle = parent->GetRight();
-
- if (tree == uncle)
- {
- parent->SetRight(left);
- }
- else
- {
- parent->SetLeft(left);
- }
- }
- else
- {
- _root = left;
- }
-
- left->SetRight(tree);
-
- if (tree)
- {
- tree->SetParent(left);
- }
- }
-
-
- void TreeNodeShallowCopy(TreeNode<Key, Data> *src,
- TreeNode<Key, Data> *dest, bool no_links)
- {
- if (!src || !dest)
- {
- return;
- }
-
- dest->SetKey(src->GetKey());
- dest->SetData(src->GetData());
- dest->SetColor(src->GetColor());
-
- if (!no_links)
- {
- dest->SetRight(src->GetRight());
- dest->SetLeft(src->GetLeft());
- dest->SetParent(src->GetParent());
- }
- }
-
-
- void Remove(TreeNode<Key, Data> *tree)
- {
- TreeNode<Key, Data> *left, *right, *parent, *prev, *cur;
-
-
-
- if (!tree || !_root)
- {
- return;
- }
-
- left = tree->GetLeft();
- right = tree->GetRight();
- parent = tree->GetParent();
-
-
- if (!left || !right)
- {
- prev = tree;
- }
- else
- {
- prev = GetSuccessor(tree);
- }
-
- if (!prev)
- return;
-
- if (prev->GetLeft())
- {
- cur = prev->GetLeft();
- }
- else
- {
- cur = prev->GetRight();
- }
-
- if (cur)
- {
- cur->SetParent(prev->GetParent());
- }
-
- if (!prev->GetParent())
- {
- _root = cur;
- }
- else
- {
- parent = prev->GetParent();
-
- if (prev == parent->GetLeft())
- {
- parent->SetLeft(cur);
- }
- else
- {
- parent->SetRight(cur);
- }
- }
-
- if (prev != tree)
- {
- TreeNodeShallowCopy(prev, tree, true);
-
- if (prev->GetParent())
- {
- if (prev == (prev->GetParent())->GetLeft())
- (prev->GetParent())->SetLeft(tree);
- else if (prev == (prev->GetParent())->GetRight())
- (prev->GetParent())->SetRight(tree);
- }
- }
-
- --_num_elements;
-
- if (prev)
- {
- prev->SetRight(NULL);
- prev->SetParent(NULL);
- prev->SetLeft(NULL);
-
- delete prev;
- }
-
- if (tree->GetColor() == _tree_h_black)
- {
- RestoreRedBlackAfterRemove(cur);
- }
- }
-
-
- void RestoreRedBlackAfterRemove(TreeNode<Key, Data> *tree)
- {
- TreeNode<Key, Data> *parent, *sibling, *sleft, *sright;
-
-
- if (!tree || !_root)
- {
- return;
- }
-
- parent = tree->GetParent();
-
- while ((tree != _root) && (parent->GetColor() == _tree_h_black))
- {
- if (tree == parent->GetLeft())
- {
- sibling = parent->GetRight();
-
- if (sibling && sibling->GetColor() == _tree_h_red)
- {
- sibling->SetColor(_tree_h_black);
- parent->SetColor(_tree_h_red);
- RotateLeft(parent);
- sibling = parent->GetRight();
- }
-
- if (sibling)
- {
- sleft = sibling->GetLeft();
- sright = sibling->GetRight();
- }
- else
- {
- sleft = sright = NULL;
- }
-
- if (sright && sright->GetColor() == _tree_h_black &&
- sleft && sleft->GetColor() ==_tree_h_black)
- {
- sibling->SetColor(_tree_h_red);
- tree = parent;
- }
- else
- {
- if (sright && sright->GetColor() == _tree_h_black)
- {
- sibling->SetColor(_tree_h_red);
- sleft->SetColor(_tree_h_black);
- RotateRight(sibling);
- sibling = parent->GetRight();
- }
-
- sibling->SetColor(parent->GetColor());
- parent->SetColor(_tree_h_black);
- sright->SetColor(_tree_h_black);
- RotateLeft(parent);
- tree = _root;
- }
- }
- else
- {
- sibling = parent->GetLeft();
-
- if (sibling && sibling->GetColor() == _tree_h_red)
- {
- sibling->SetColor(_tree_h_black);
- parent->SetColor(_tree_h_red);
- RotateLeft(parent);
- sibling = parent->GetLeft();
- }
-
- if (sibling)
- {
- sleft = sibling->GetLeft();
- sright = sibling->GetRight();
- }
- else
- {
- sleft = sright = NULL;
- }
-
- if (sright && sright->GetColor() == _tree_h_black &&
- sleft && sleft->GetColor() ==_tree_h_black)
- {
- sibling->SetColor(_tree_h_red);
- tree = parent;
- }
- else
- {
- if (sleft && sleft->GetColor() == _tree_h_black)
- {
- sibling->SetColor(_tree_h_red);
- sright->SetColor(_tree_h_black);
- RotateLeft(sibling);
- sibling = parent->GetLeft();
- }
-
- sibling->SetColor(parent->GetColor());
- parent->SetColor(_tree_h_black);
- sleft->SetColor(_tree_h_black);
- RotateRight(parent);
- tree = _root;
- }
- }
-
- parent = tree->GetParent();
- }
-
- tree->SetColor(_tree_h_black);
- }
-
-
- void RestoreRedBlackAfterInsert(TreeNode<Key, Data> *tree)
- {
- TreeNode<Key, Data> *parent, *grandparent, *uncle;
-
-
- if (!tree || !_root || tree == _root)
- {
- return;
- }
-
- tree->SetColor(_tree_h_red);
-
- parent = tree->GetParent();
-
- while ((tree != _root) && (parent->GetColor() == _tree_h_red))
- {
- grandparent = parent->GetParent();
-
- if (parent == grandparent->GetLeft())
- {
- uncle = grandparent->GetRight();
-
- if (uncle && uncle->GetColor() == _tree_h_red)
- {
-
- parent->SetColor(_tree_h_black);
- uncle->SetColor(_tree_h_black);
- grandparent->SetColor(_tree_h_red);
-
-
- tree = grandparent;
- }
- else
- {
- if (tree == parent->GetRight())
- {
-
- tree = parent;
- RotateLeft(tree);
- }
-
-
-
-
- parent->SetColor(_tree_h_black);
- grandparent->SetColor(_tree_h_red);
- RotateRight(grandparent);
- }
- }
- else
- {
- uncle = grandparent->GetLeft();
-
- if (uncle && uncle->GetColor() == _tree_h_red)
- {
-
- parent->SetColor(_tree_h_black);
- uncle->SetColor(_tree_h_black);
- grandparent->SetColor(_tree_h_red);
-
-
- tree = grandparent;
- }
- else
- {
- if (tree == parent->GetLeft())
- {
-
- tree = parent;
- RotateRight(tree);
- }
-
-
-
-
- parent->SetColor(_tree_h_black);
- grandparent->SetColor(_tree_h_red);
- RotateLeft(grandparent);
- }
- }
-
-
- parent = tree->GetParent();
- }
-
-
- _root->SetColor(_tree_h_black);
- }
-
- bool _error;
- unsigned int _num_elements;
- TreeNode<Key, Data> *_root;
- };
-
|