小链表

#include <iostream>

using namespace std;

struct Node{
    int data;
    Node* Next;
};

Node *Head = NULL, *Tail = NULL;

void PushBack(int data)
{
    Node *NewNode = new Node;
    
    NewNode->data = data;
    NewNode->Next = NULL;
    
    if (Head == NULL)
    {
        Head = NewNode;
        Tail = NewNode;
    }
    else
    {
        Tail->Next = NewNode;
        Tail = Tail->Next;
        Tail->Next = NULL;
    }
}

int main()
{
    PushBack(5);
    PushBack(6);
    PushBack(7);
    PushBack(8);
    
    Node *Curent = Head;
    while (Curent != NULL)
    {
        cout << Curent->data << endl;;
        Curent = Curent->Next;
    }
    return 0;
}