二叉搜索树的删除和添加

最新推荐文章于 2022-12-29 07:30:00 发布

李家那小二

最新推荐文章于 2022-12-29 07:30:00 发布

阅读量259

点赞数

分类专栏：算法 c++ 文章标签：算法二叉搜索树 c++

本文链接：https://blog.csdn.net/Mr_LeeY/article/details/76579247

版权

算法同时被 2 个专栏收录

9 篇文章 0 订阅

订阅专栏

c++

5 篇文章 0 订阅

订阅专栏

和算法导论上说明的一样，主要是实现下，给自己留着备用。

struct Tree
{
    int value;
    Tree* l_child;
    Tree* r_child;
    Tree* parent;
};

void deleteNode(Tree * tree, Tree* node)
{
    Tree* temp = node->parent;
    if (node->l_child)
    {
        if (node->r_child)
        {
            Tree* temp_node = searchMin(temp->r_child);
            deleteNode(temp, node, temp_node);
            temp_node->l_child = node->l_child;
        }
        else
        {
            deleteNode(temp, node, node->l_child);
        }
    }
    else if(node->r_child)
    {
        Tree* temp_node = searchMin(temp->r_child);
        deleteNode(temp, node, temp_node);
    }
    else
    {
        replace(temp, node);
    }
}

void deleteNode(Tree* parent, Tree* delete_tree, Tree* replace_node)
{
    if (replace_node)
    {
        if (replace_node->parent)//replace为最小元素，肯定无左孩子
        {
            replace_node->parent->l_child = replace_node->r_child;
        }
        if (replace_node->r_child)
        {
            replace_node->r_child->parent = replace_node->parent;
        }
    }
    //处理删除节点
    replace(parent, delete_tree, replace_node);
}

void replace(Tree* parent, Tree* delete_tree, Tree* node = NULL)
{
    if (parent->l_child == delete_tree)
    {
        parent->l_child = node;
    }
    else
    {
        parent->r_child = node;
    }
    if (node)
    {
        node->parent = parent;
    }
}

Tree* searchMin(Tree* node)
{
    if (node == NULL)
    {
        return node;
    }
    Tree* ptr = node;
    while (ptr->l_child != NULL)
    {
        ptr = ptr->l_child;
    }
    return ptr;
}

void pushNode(Tree* tree, Tree* z)
{
    Tree *parent = NULL, *current = tree;
    while (current != NULL)
    {
        parent = current;
        if (current->value < z->value)
        {
            current = current->r_child;
        }
        else
        {
            current = current->l_child;
        }
    }
    if (parent == NULL)
    {
        tree = z;
    }
    else
    {
        if (parent->value < z->value)
        {
            parent->r_child = z;
        }
        else
        {
            parent->l_child = z;
        }
        z->parent = parent;
    }
}