数据结构复习（二）链表的定义和操作

#include<iostream>
using namespace std;

typedef struct Node{
    int data;
    Node *next;
}Node, *LinkList;

LinkList InitList(){
    LinkList L = new Node;
    L -> next = NULL;
    return L;
}

bool InsertToList(LinkList &L, int value){
    Node *p = new Node;
    p -> data = value;
    p -> next = L -> next;
    L -> next = p;
}

void PrintList(LinkList L){
    Node *p = L -> next;
    while(p != NULL){
        cout<<p -> data<<" ";
        p = p -> next;
    }
    cout<<endl;
}

int main(){
    LinkList L = InitList();
    int data[10] = {3, 5, 6, 7, 8};
    for(int i = 0; i < 5; i++){
        InsertToList(L, data[i]);
    }
    PrintList(L);
}