leftist (左偏堆,插入与弹出功能的实现)

最新推荐文章于 2020-12-22 15:30:12 发布

chenbingchenbing

最新推荐文章于 2020-12-22 15:30:12 发布

阅读量629

点赞数

CC 4.0 BY-SA版权

分类专栏：综合文章标签： merge struct null 扩展存储

本文链接：https://blog.youkuaiyun.com/chenbingchenbing/article/details/7064350

综合专栏收录该内容

107 篇文章

订阅专栏

本文介绍了一种高效的数据结构——左偏堆，并通过代码详细展示了如何构建与调整左偏堆，以及如何进行元素的合并与弹出操作。左偏堆是一种自平衡的二叉查找树，特别适用于频繁合并的操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

与堆相比没有那么强烈的关系和限制。不过想想，如果要扩展原始堆，比如扩展为链表存储的形式，好像也就只能走左偏堆的路子。

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

#define NIL 99999

typedef struct _leftist
{
int key;
int dis;
struct _leftist *left;
struct _leftist *right;
}leftist;

leftist *newstruct ( int key);

leftist *nilstruct ( )
{
static   leftist *obj=NULL;
if (!obj )
    {
      obj=newstruct ( NIL);
      obj->key=NIL;
      obj->dis=0;
    }
else
    {
    }
return obj;
}

leftist *newstruct ( int key)
{
leftist *obj=(leftist *)calloc ( 1 ,sizeof (leftist));
obj->dis=0;
obj->key=key;
return obj;
}

leftist *leftist_adjust ( leftist *left)
{
leftist *tmp;
if(!left->left)
    {
    }
else
    {
      if(left->left->dis>= left->right->dis)
{
   left->dis=left->right->dis+1;
   return left;
}
    }

tmp=left->left;
left->left=left->right;
left->right=tmp;

if(!left->right)
    {
      left->dis=0;
    }
else
    {
      left->dis=left->right->dis+1;
    }
return left;
}

leftist * leftist_merge ( leftist *left ,leftist *right)
{
if(!left)
    {
      return right;
    }
if (!right)
    {
      return left;
    }
if (left->key < right->key)
    {
      left->right=leftist_merge ( left->right ,right );
      return   leftist_adjust (left);

    }
else
    {
      right->right=leftist_merge ( left ,right->right);
      return leftist_adjust ( right );
    }
}

leftist *leftist_pop ( leftist **head)
{
leftist *result=*head;
*head=leftist_merge ( result->left ,result->right );
return result;
}

int main()
{
int i;
leftist *head=NULL;
leftist *obj=NULL;
int   a[]={11,45,32,22,145,333,789,76,31,90,10,20,50,666,1111,9};
for(i=0;i<sizeof (a )/sizeof (int );i++)
    {
      obj=newstruct ( a[i]);
      head= leftist_merge ( head ,obj );
    }

while(1)
    {
      if (! head->left && !head->right )
{
   obj=head;
   printf(" %d ",obj->key);
   break;
}
      obj=leftist_pop ( &head);
      printf(" %d ",obj->key);
    }

}