5-16.c

来自「数据结构经典算法」· C语言 代码 · 共 27 行

#include "stdio.h"
typedef struct   poly_node{
    int  coef;
    int  expon;
    struct   poly_node  *link;
};
typedef struct   poly_node  *poly_pointer;
poly_pointer get_node(void)
{
    poly_pointer node,avail;
    if ( avail ) {
        node = avail;
        avail = avail->link;
	}
   else {
        node = (poly_pointer)malloc(sizeof(poly_pointer));
        if (node==NULL) {
             fprintf(stderr, "The memory is full\n");
             exit(1);
        }
    }
    return node;
}
void main()
{
	poly_pointer p=get_node();
}