最简单的单链表（静态单链表）

#include<iostream>using namespace std;typedef struct node{int data;struct node *next;}Node;int main(){   Node a1, a2, a3;   Node *head = NULL;   Node *p1 = &a1;   p1->data = 1;   Node *p2 = &a2;   p2->data = 2;   Node *p3 = &a3;   p3->data = 3;   //把结点连接起来   head = p1;   p1->next = p2;   p2->next = p3;   p3->next = NULL;   //遍历结点   Node *p = head;   while(NULL != p)   {cout << p ->data << endl;p = p->next;   }     return 0;}