5-5 堆中的路径

方法一：用插入法建堆，结果和给的案例一样

#include<stdio.h>
#include<stdlib.h>
#define maxsize 1000
#define mindata -10001
typedef struct node *heap;
struct node
{
    int *Data;
    int size;
};
heap create(int MaxSize)
{
   heap H=malloc(sizeof(struct node));
   H->Data=malloc(sizeof(int)*(MaxSize+1));
   H->size=0;
   H->Data[0]=mindata;
   return H;
}
heap Insert(heap H,int item)
{
    int i;
    H->size++;
    for(i=H->size;H->Data[i/2]>item;i=i/2)
        H->Data[i]=H->Data[i/2];
    H->Data[i]=item;
    return H;
}
main()
{
    int N,M,x,y,i,j;
    heap H;
    H=create(maxsize);
    scanf("%d%d",&N,&M);
    for(i=0;i<N;i++)
    {
        scanf("%d",&x);
         H=Insert(H,x);
    }
    for(i=0;i<M;i++)
    {
        scanf("%d",&y);
        for(j=y;j>1;j=j/2)
            printf("%d ",H->Data[j]);
        printf("%d\n",H->Data[1]);
    }
}

方法二：先将元素存储在堆中，然后经过最小堆调整达到最小堆得建立，但是这种方案建的堆和前面不一样，某些根节点下面的左右子树会发现互换的现象。导致路径不同。

#include<stdio.h>
#include<stdlib.h>
#define maxsize 1000
#define mindata -10001
typedef struct node *heap;
struct node
{
    int *Data;
    int size;
};
heap create(int N)//建立一个堆
{
   int i,x;
   heap H=malloc(sizeof(struct node));
   H->Data=malloc(sizeof(int)*(maxsize+1));
   H->size=0;
   H->Data[0]=mindata;
   for(i=0;i<N;i++)
   {
       scanf("%d",&x);
       H->Data[++H->size]=x;
   }
   return H;
}
heap build(heap H)//对堆中元素进行调整，使其变成最小堆
{
    int parent,child,i,temp;
    for(i=H->size/2;i>0;i--)
    {
        temp=H->Data[i];
        for(parent=i;2*parent<=H->size;parent=child)
        {
            child=parent*2;
            if((child!=H->size)&&(H->Data[child]>H->Data[child+1]))
                child++;
            if(temp<=H->Data[child])break;
            else
                H->Data[parent]=H->Data[child];
        }
        H->Data[parent]=temp;
    }
    return H;
}
main()
{
    int N,M,y,i,j;
    heap H1,H2;
    scanf("%d%d",&N,&M);
    H1=create(N);
    H2=build(H1);
    for(i=0;i<M;i++)
    {
        scanf("%d",&y);
        for(j=y;j>1;j=j/2)//从该结点序号开始，一直向上打印父节点
            printf("%d ",H2->Data[j]);
        printf("%d\n",H2->Data[1]);
    }
}