链表逆序
时间：2010-10-14 来源：dovolop
#ifndef _CREATELIST_H
#define _CREATELIST_H
#define DATA_TYPE char
typedef struct _node
{
DATA_TYPE data;
struct _node *next;
}node,*pnode; pnode head(DATA_TYPE d_in[],int len);
void traverse(pnode list);
pnode tail(DATA_TYPE d_in[],int len);
pnode reverse(pnode list); #endif
#define _CREATELIST_H
#define DATA_TYPE char
typedef struct _node
{
DATA_TYPE data;
struct _node *next;
}node,*pnode; pnode head(DATA_TYPE d_in[],int len);
void traverse(pnode list);
pnode tail(DATA_TYPE d_in[],int len);
pnode reverse(pnode list); #endif
相关阅读 更多 +
