久久国产精品免费一区,老司机aⅴ在线精品导航,亚洲国产成人av好男人在线观看

紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版)

我曾經(jīng)寫過(guò)兩個(gè)兩個(gè)紅黑樹(shù)的實(shí)現(xiàn), 分別在:
http://m.shnenglu.com/converse/archive/2006/10/07/13413.html
http://m.shnenglu.com/converse/archive/2007/11/28/37430.html

最近因?yàn)橐occache加入紅黑樹(shù)的支持, 找出來(lái)曾經(jīng)實(shí)現(xiàn)的代碼作為參考, 這才發(fā)現(xiàn)原來(lái)的實(shí)現(xiàn)都是有問(wèn)題的,也怪我的測(cè)試用例寫的不好, 僅僅對(duì)插入操作進(jìn)行了測(cè)試, 我向所有因?yàn)殚喿x了這份代碼而造成困惑的朋友表示道歉.

這次重新實(shí)現(xiàn), 所有的代碼推倒重新編寫, 參考了linux內(nèi)核中紅黑樹(shù)的實(shí)現(xiàn)算法, 并且對(duì)測(cè)試用例進(jìn)行了加強(qiáng),希望這是最后一個(gè)對(duì)紅黑樹(shù)算法的修訂版本.

/*-----------------------------------------------------------
    RB-Tree的插入和刪除操作的實(shí)現(xiàn)算法
    參考資料:
    1) <<Introduction to algorithm>>
    2) http://lxr.linux.no/linux/lib/rbtree.c

    作者：http://m.shnenglu.com/converse/
    您可以自由的傳播，修改這份代碼，轉(zhuǎn)載處請(qǐng)注明原作者

    紅黑樹(shù)的幾個(gè)性質(zhì):
    1) 每個(gè)結(jié)點(diǎn)只有紅和黑兩種顏色
    2) 根結(jié)點(diǎn)是黑色的
    3)空節(jié)點(diǎn)是黑色的（紅黑樹(shù)中，根節(jié)點(diǎn)的parent以及所有葉節(jié)點(diǎn)lchild、rchild都不指向NULL，而是指向一個(gè)定義好的空節(jié)點(diǎn)）。
    4) 如果一個(gè)結(jié)點(diǎn)是紅色的,那么它的左右兩個(gè)子結(jié)點(diǎn)的顏色是黑色的
    5) 對(duì)于每個(gè)結(jié)點(diǎn)而言,從這個(gè)結(jié)點(diǎn)到葉子結(jié)點(diǎn)的任何路徑上的黑色結(jié)點(diǎn)
    的數(shù)目相同
-------------------------------------------------------------*/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef int key_t;
typedef int data_t;

typedef enum color_t
{
    RED = 0,
    BLACK = 1
}color_t;

typedef struct rb_node_t
{
    struct rb_node_t *left, *right, *parent;
    key_t key;
    data_t data;
    color_t color;
}rb_node_t;

/* forward declaration */
rb_node_t* rb_insert(key_t key, data_t data, rb_node_t* root);
rb_node_t* rb_search(key_t key, rb_node_t* root);
rb_node_t* rb_erase(key_t key, rb_node_t* root);

int main()
{
    int i, count = 900000;
    key_t key;
    rb_node_t* root = NULL, *node = NULL;

    srand(time(NULL));
    for (i = 1; i < count; ++i)
    {
        key = rand() % count;
        if ((root = rb_insert(key, i, root)))
        {
            printf("[i = %d] insert key %d success!\n", i, key);
        }
        else
        {
            printf("[i = %d] insert key %d error!\n", i, key);
            exit(-1);
        }

        if ((node = rb_search(key, root)))
        {
            printf("[i = %d] search key %d success!\n", i, key);
        }
        else
        {
            printf("[i = %d] search key %d error!\n", i, key);
            exit(-1);
        }
        if (!(i % 10))
        {
            if ((root = rb_erase(key, root)))
            {
                printf("[i = %d] erase key %d success\n", i, key);
            }
            else
            {
                printf("[i = %d] erase key %d error\n", i, key);
            }
        }
    }

    return 0;
}

static rb_node_t* rb_new_node(key_t key, data_t data)
{
    rb_node_t *node = (rb_node_t*)malloc(sizeof(struct rb_node_t));

    if (!node)
    {
        printf("malloc error!\n");
        exit(-1);
    }
    node->key = key, node->data = data;

    return node;
}

/*-----------------------------------------------------------
|   node           right
|   / \    ==>     / \
|   a right     node y
|       / \           / \
|       b y         a   b
-----------------------------------------------------------*/
static rb_node_t* rb_rotate_left(rb_node_t* node, rb_node_t* root)
{
    rb_node_t* right = node->right;

    if ((node->right = right->left))
    {
        right->left->parent = node;
    }
    right->left = node;

    if ((right->parent = node->parent))
    {
        if (node == node->parent->right)
        {
            node->parent->right = right;
        }
        else
        {
            node->parent->left = right;
        }
    }
    else
    {
        root = right;
    }
    node->parent = right;

    return root;
}

/*-----------------------------------------------------------
|       node           left
|       / \            / \
|    left y   ==>    a   node
|   / \               / \
| a   b             b   y
-----------------------------------------------------------*/
static rb_node_t* rb_rotate_right(rb_node_t* node, rb_node_t* root)
{
    rb_node_t* left = node->left;

    if ((node->left = left->right))
    {
        left->right->parent = node;
    }
    left->right = node;

    if ((left->parent = node->parent))
    {
        if (node == node->parent->right)
        {
            node->parent->right = left;
        }
        else
        {
            node->parent->left = left;
        }
    }
    else
    {
        root = left;
    }
    node->parent = left;

    return root;
}

static rb_node_t* rb_insert_rebalance(rb_node_t *node, rb_node_t *root)
{
    rb_node_t *parent, *gparent, *uncle, *tmp;

    while ((parent = node->parent) && parent->color == RED)
    {
        gparent = parent->parent;

        if (parent == gparent->left)
        {
            uncle = gparent->right;
            if (uncle && uncle->color == RED)
            {
                uncle->color = BLACK;
                parent->color = BLACK;
                gparent->color = RED;
                node = gparent;
            }
            else
            {
                if (parent->right == node)
                {
                    root = rb_rotate_left(parent, root);
                    tmp = parent;
                    parent = node;
                    node = tmp;
                }

                parent->color = BLACK;
                gparent->color = RED;
                root = rb_rotate_right(gparent, root);
            }
        }
        else
        {
            uncle = gparent->left;
            if (uncle && uncle->color == RED)
            {
                uncle->color = BLACK;
                parent->color = BLACK;
                gparent->color = RED;
                node = gparent;
            }
            else
            {
                if (parent->left == node)
                {
                    root = rb_rotate_right(parent, root);
                    tmp = parent;
                    parent = node;
                    node = tmp;
                }

                parent->color = BLACK;
                gparent->color = RED;
                root = rb_rotate_left(gparent, root);
            }
        }
    }

    root->color = BLACK;

    return root;
}

static rb_node_t* rb_erase_rebalance(rb_node_t *node, rb_node_t *parent, rb_node_t *root)
{
    rb_node_t *other, *o_left, *o_right;

    while ((!node || node->color == BLACK) && node != root)
    {
        if (parent->left == node)
        {
            other = parent->right;
            if (other->color == RED)
            {
                other->color = BLACK;
                parent->color = RED;
                root = rb_rotate_left(parent, root);
                other = parent->right;
            }
            if ((!other->left || other->left->color == BLACK) &&
                (!other->right || other->right->color == BLACK))
            {
                other->color = RED;
                node = parent;
                parent = node->parent;
            }
            else
            {
                if (!other->right || other->right->color == BLACK)
                {
                    if ((o_left = other->left))
                    {
                        o_left->color = BLACK;
                    }
                    other->color = RED;
                    root = rb_rotate_right(other, root);
                    other = parent->right;
                }
                other->color = parent->color;
                parent->color = BLACK;
                if (other->right)
                {
                    other->right->color = BLACK;
                }
                root = rb_rotate_left(parent, root);
                node = root;
                break;
            }
        }
        else
        {
            other = parent->left;
            if (other->color == RED)
            {
                other->color = BLACK;
                parent->color = RED;
                root = rb_rotate_right(parent, root);
                other = parent->left;
            }
            if ((!other->left || other->left->color == BLACK) &&
                (!other->right || other->right->color == BLACK))
            {
                other->color = RED;
                node = parent;
                parent = node->parent;
            }
            else
            {
                if (!other->left || other->left->color == BLACK)
                {
                    if ((o_right = other->right))
                    {
                        o_right->color = BLACK;
                    }
                    other->color = RED;
                    root = rb_rotate_left(other, root);
                    other = parent->left;
                }
                other->color = parent->color;
                parent->color = BLACK;
                if (other->left)
                {
                    other->left->color = BLACK;
                }
                root = rb_rotate_right(parent, root);
                node = root;
                break;
            }
        }
    }

    if (node)
    {
        node->color = BLACK;
    }

    return root;
}

static rb_node_t* rb_search_auxiliary(key_t key, rb_node_t* root, rb_node_t** save)
{
    rb_node_t *node = root, *parent = NULL;
    int ret;

    while (node)
    {
        parent = node;
        ret = node->key - key;
        if (0 < ret)
        {
            node = node->left;
        }
        else if (0 > ret)
        {
            node = node->right;
        }
        else
        {
            return node;
        }
    }

    if (save)
    {
        *save = parent;
    }

    return NULL;
}

rb_node_t* rb_insert(key_t key, data_t data, rb_node_t* root)
{
    rb_node_t *parent = NULL, *node;

    parent = NULL;
    if ((node = rb_search_auxiliary(key, root, &parent)))
    {
        return root;
    }

    node = rb_new_node(key, data);
    node->parent = parent;
    node->left = node->right = NULL;
    node->color = RED;

    if (parent)
    {
        if (parent->key > key)
        {
            parent->left = node;
        }
        else
        {
            parent->right = node;
        }
    }
    else
    {
        root = node;
    }

    return rb_insert_rebalance(node, root);
}

rb_node_t* rb_search(key_t key, rb_node_t* root)
{
    return rb_search_auxiliary(key, root, NULL);
}

rb_node_t* rb_erase(key_t key, rb_node_t *root)
{
    rb_node_t *child, *parent, *old, *left, *node;
    color_t color;

    if (!(node = rb_search_auxiliary(key, root, NULL)))
    {
        printf("key %d is not exist!\n");
        return root;
    }

    old = node;

    if (node->left && node->right)
    {
        node = node->right;
        while ((left = node->left) != NULL)
        {
            node = left;
        }
        child = node->right;
        parent = node->parent;
        color = node->color;

        if (child)
        {
            child->parent = parent;
        }
        if (parent)
        {
            if (parent->left == node)
            {
                parent->left = child;
            }
            else
            {
                parent->right = child;
            }
        }
        else
        {
            root = child;
        }

        if (node->parent == old)
        {
            parent = node;
        }

        node->parent = old->parent;
        node->color = old->color;
        node->right = old->right;
        node->left = old->left;

        if (old->parent)
        {
            if (old->parent->left == old)
            {
                old->parent->left = node;
            }
            else
            {
                old->parent->right = node;
            }
        }
        else
        {
            root = node;
        }

        old->left->parent = node;
        if (old->right)
        {
            old->right->parent = node;
        }
    }
    else
    {
        if (!node->left)
        {
            child = node->right;
        }
        else if (!node->right)
        {
            child = node->left;
        }
        parent = node->parent;
        color = node->color;

        if (child)
        {
            child->parent = parent;
        }
        if (parent)
        {
            if (parent->left == node)
            {
                parent->left = child;
            }
            else
            {
                parent->right = child;
            }
        }
        else
        {
            root = child;
        }
    }

    free(old);

    if (color == BLACK)
    {
        root = rb_erase_rebalance(child, parent, root);
    }

    return root;
}

posted on 2008-11-10 17:50 那誰(shuí) 閱讀(13828) 評(píng)論(18) 編輯收藏引用所屬分類: 算法與數(shù)據(jù)結(jié)構(gòu)

評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

我暈倒，有沒(méi)有優(yōu)雅一點(diǎn)的，至少短一點(diǎn)的實(shí)現(xiàn)？

2008-11-11 15:42 | Wang Feng

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

@Wang Feng
樓上的朋友,如果你不滿意,大可以自己也去實(shí)現(xiàn)一下看看:)

2008-11-11 23:33 | 創(chuàng)

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

寫得很藝術(shù)
nice

2008-11-12 12:28 | haskell

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版)[未登錄](méi) 回復(fù) 更多評(píng)論

csdn中的那個(gè)也是你發(fā)的吧？呵.....

2008-11-18 16:53 | lin

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

@lin
CSDN?我不知道這個(gè)事情,這個(gè)帖子是我在cppblog的原創(chuàng).

2008-11-19 00:05 | 創(chuàng)

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

搬個(gè)凳子慢慢看

2009-01-15 01:02 | linnet

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版)[未登錄](méi) 回復(fù) 更多評(píng)論

怎麼無(wú)法編譯呢?

2009-04-29 03:33 | candy

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版)[未登錄](méi) 回復(fù) 更多評(píng)論

@candy
你的編譯命令是??
我這邊直接gcc就行了

2009-04-29 12:49 | 那誰(shuí)

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版)[未登錄](méi) 回復(fù) 更多評(píng)論

請(qǐng)高手指教，謝謝。
我將main函數(shù)改為，
int main()
{
int i;
key_t key;
rb_node_t* root = NULL, *node = NULL;

while(1)
{
printf("insert: ");
scanf("%d", &key);
if(key <= 0)
break;
if ((root = rb_insert(key, i, root)))
{
printf("[i = %d] insert key %d success!\n", i, key);
}
else
{
printf("[i = %d] insert key %d error!\n", i, key);
exit(-1);
}
}

while(1)
{
printf("delete: ");
scanf("%d", &key);
if(key <= 0)
break;
if ((root = rb_erase(key, root)))
{
printf("[i = %d] erase key %d success\n", i, key);
}
else
{
printf("[i = %d] erase key %d error\n", i, key);
}
}
return 0;
}
編譯并運(yùn)行，
insert: 9
[i = 2] insert key 9 success!
insert: 0
delete: 9
[i = 2] erase key 9 error
delete: 0
請(qǐng)問(wèn)是什么原因，謝謝。

2010-02-04 16:51 | Jason

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

When students want to uderstand about the <a href="http://www.exclusivepapers.com/papers-for-money.php">papers for money</a> they can <a href="http://www.exclusivepapers.com/buy-essay.php">buy essay</a> related to this post. Because the critical essay creating has to be a really important thing.

2010-02-22 15:02 | EllavC

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

@EllavC
數(shù)依然是有問(wèn)題的，將你的測(cè)試用例改為下面的試試
//-------------------
int main()
{
int i, count = 10000;
key_t key;
rb_node_t* root = NULL, *node = NULL;

srand(time(NULL));
for (i = 1; i < count; ++i)
{
key = rand() % count;
if ((root = rb_insert(key, i, root)))
{
printf("[i = %d] insert key %d success!\n", i, key);
}
else
{
printf("[i = %d] insert key %d error!\n", i, key);
exit(-1);
}

if ((node = rb_search(key, root)))
{
if (i != node->data) {
printf("[i = %d] search key %d success! <-- X\n", node->data, node->key);
printf("[i = %d] != [node->data = %d ] <-- [key = %d], [node->key = %d]\n", i, node->data, key, node->key);
}
else
printf("[i = %d] search key %d success!\n", node->data, node->key);
}
else
{
printf("[i = %d] search key %d error!\n", i, key);
exit(-1);
}
if (!(i % 10))
{
if ((root = rb_erase(key, root)))
{
printf("[i = %d] erase key %d success\n", i, key);
}
else
{
printf("[i = %d] erase key %d error\n", i, key);
}
}
}

return 0;
}
//-------------------
//-------------------
// 結(jié)果的部分內(nèi)容
/*
[i = 9984] != [node->data = 6004 ] <-- [key = 5893], [node->key = 5893]
[i = 9985] insert key 4330 success!
[i = 2445] search key 4330 success! <-- X
[i = 9985] != [node->data = 2445 ] <-- [key = 4330], [node->key = 4330]
[i = 9986] insert key 1927 success!
[i = 227] search key 1927 success! <-- X
[i = 9986] != [node->data = 227 ] <-- [key = 1927], [node->key = 1927]
[i = 9987] insert key 7978 success!
[i = 647] search key 7978 success! <-- X
[i = 9987] != [node->data = 647 ] <-- [key = 7978], [node->key = 7978]
[i = 9988] insert key 7759 success!
[i = 4671] search key 7759 success! <-- X
[i = 9988] != [node->data = 4671 ] <-- [key = 7759], [node->key = 7759]
[i = 9989] insert key 1231 success!
[i = 4022] search key 1231 success! <-- X
[i = 9989] != [node->data = 4022 ] <-- [key = 1231], [node->key = 1231]
[i = 9990] insert key 1550 success!
[i = 9990] search key 1550 success!
[i = 9990] erase key 1550 success
[i = 9991] insert key 7396 success!
[i = 7878] search key 7396 success! <-- X
[i = 9991] != [node->data = 7878 ] <-- [key = 7396], [node->key = 7396]
[i = 9992] insert key 5687 success!
[i = 9992] search key 5687 success!
[i = 9993] insert key 1755 success!
[i = 9993] search key 1755 success!
[i = 9994] insert key 9388 success!
[i = 9994] search key 9388 success!
[i = 9995] insert key 8158 success!
[i = 9352] search key 8158 success! <-- X
[i = 9995] != [node->data = 9352 ] <-- [key = 8158], [node->key = 8158]
[i = 9996] insert key 7122 success!
[i = 56] search key 7122 success! <-- X
[i = 9996] != [node->data = 56 ] <-- [key = 7122], [node->key = 7122]
[i = 9997] insert key 6220 success!
[i = 8154] search key 6220 success! <-- X
[i = 9997] != [node->data = 8154 ] <-- [key = 6220], [node->key = 6220]
[i = 9998] insert key 9219 success!
[i = 9998] search key 9219 success!
*/
//---------------
/*
你的測(cè)試用例全部正確是因?yàn)槟銢](méi)有去判斷通過(guò)key查到的node里面的內(nèi)容是否和放入的內(nèi)容一致，我在此比了一下，問(wèn)題暴露出來(lái)了
*/

2011-07-19 15:46 | rc8523

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

@rc8523
<-- X 代表的是有問(wèn)題的地方
下面一行是節(jié)點(diǎn)詳細(xì)內(nèi)容

2011-07-19 15:48 | rc8523

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

@rc8523
因?yàn)閞b_insert()了已經(jīng)存在的key后，并不返回NULL,而是
直接返回root指針，所以rb_search()的返回值在這種情況下
只是上次插入的節(jié)點(diǎn)

2012-01-05 14:57 | qman007

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

你現(xiàn)在的實(shí)現(xiàn)還是有問(wèn)題吧好好看看

2012-04-18 09:19 | Apollo Fang

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

替換數(shù)據(jù)不是更好?

2012-04-19 10:26 | Apollo Fang

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

也怪我的測(cè)試用例寫的不好, 僅僅對(duì)插入操作進(jìn)行了測(cè)試, 我向所有因?yàn)殚喿x了這份代碼而造成困

2012-08-03 19:25 | regalos originales aniversario

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

例寫的不好, 僅僅對(duì)插入操作進(jìn)行了測(cè)試, 我向所有因?yàn)殚喿x了

2012-08-04 15:17 | wholesale kurti

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

也怪我的測(cè)試用例寫的不好, 僅僅對(duì)插入操作進(jìn)行了測(cè)試, 我向所有因?yàn)殚喿x了這份代碼而造成困

2012-11-27 20:19 | abogados divorcios madrid

刷新評(píng)論列表

只有注冊(cè)用戶登錄后才能發(fā)表評(píng)論。


相關(guān)文章: [算法]如何根據(jù)數(shù)據(jù)的多種屬性來(lái)查找數(shù)據(jù) Btree算法實(shí)現(xiàn)代碼二分查找學(xué)習(xí)札記把二分查找算法寫正確需要注意的地方在一個(gè)有序序列中查找重復(fù)/不存在的數(shù) 自己實(shí)現(xiàn)的memcpy 另類的鏈表數(shù)據(jù)結(jié)構(gòu)以及算法 memcached內(nèi)存管理算法二分查找算法(迭代和遞歸版本) ccache發(fā)布0.5版本

網(wǎng)站導(dǎo)航: 博客園 IT新聞 BlogJava 博問(wèn) Chat2DB 管理

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版)[未登錄](méi) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版)[未登錄](méi) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版)[未登錄](méi) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版)[未登錄](méi) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

# re: 紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版) 回復(fù) 更多評(píng)論

青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品

那誰(shuí)的技術(shù)博客

紅黑樹(shù)的實(shí)現(xiàn)源碼(第二次修訂版)

評(píng)論

導(dǎo)航

公告

常用鏈接

留言簿(71)

隨筆分類(264)

隨筆檔案(210)

相冊(cè)

關(guān)于我

開(kāi)源項(xiàng)目

論壇

朋友

搜索

最新評(píng)論

閱讀排行榜

評(píng)論排行榜