数据结构链表的封装.doc

数据结构——链表的封装
作者：冯老师,华清远见嵌入式学院讲师。
链表是数据结构中最基本的线性结构，在编程中使用的频率最高，那么如何用封装思想来编写一个完整的链表操作呢？且看以下代码的实例。
/*功能：演示链表的操作方法linklist_destroy(list);
                return 0;
        }
        linklist_t *linklist_init(int len)
        {
                linklist_t *list = NULL;
                list = malloc(sizeof(*list));
                list->head = create_linknode(0);
                list->clen = 0;
                list->tlen = len;
                return list;
        }
        int linklist_destroy(linklist_t *list)
        {
                linknode_t *p = list->head;
                linknode_t *tmp = NULL;
                while (NULL != p) {
                        tmp = p;
                        p = p->next;
                        free(tmp);
                }
                free(list);
                return 0;
        }
        int linklist_insert(linklist_t *list, int value)
        {
                linknode_t *new = NULL;
                if (list->clen >= list->tlen)
                return -1;
                new = create_linknode(value);
                new->next = list->head->next;
                list->head->next = new;
                list->clen++;
                return 0;
        }
        linknode_t *create_linknode(int value)
        {
                linknode_t *node = NULL;
                node = malloc(sizeof(*node));