自己用模板實(shí)現(xiàn)的紅黑樹,算是對(duì)紅黑樹有了一個(gè)深入的了解.
測(cè)試代碼如下:
#include <iostream>
#include "rb_tree.h"
void test()
{
rb_tree<int, int> ltree;
std::cout << "the tree is empty: " << (ltree.empty() ? "true" : "false") << std::endl;
for(int i = 0; i < 15; i++) {
ltree.insert(i, i);
}
ltree.show_tree();
}
int main(int argc, char* argv[])
{
test();
return 0;
}
紅黑樹的代碼位置:
http://m.shnenglu.com/Files/hdqqq/rb_tree.zip