C++实现单链表基本操作
本博客按照上篇博客线性表单链表的基本操作而写出的完整代码,详情请看单链表基础概念
#include <iostream>
using namespace std;
#define OK 1
#define ERROR 0
typedef int Status;
typedef char ElemType;
typedef struct LNode{
ElemType data;
struct LNode * next;
} LNode, * LinkList;
LinkList L;
LNode * p, * q, * s, * r;
int j;
Status InitList ( LinkList & L) ;
Status DestroyList ( LinkList & L) ;
Status ClearList ( LinkList & L) ;
int ListEmpty ( LinkList L) ;
int ListLength ( LinkList L) ;
Status GetElem ( LinkList L, int i, ElemType & e) ;
Status LocateElem ( LinkList L, ElemType & e) ;
Status ListInsert ( LinkList & L, int i, ElemType e) ;
Status ListDelete ( LinkList & L, int i, ElemType & e) ;
void CreateList_H ( LinkList & L, int n) ;
void CreateList_R ( LinkList & L, int n) ;
int main ( ) {
int ret= InitList ( L) ;
if ( ret)
cout << "建立单链表成功" << endl;
else
cout