单向链表

#include<bits/stdc++.h>
using namespace std;
struct Node{
    int data;
    Node *next;
};
void insert(Node *p, int data){
    Node *new_node = new Node{data,NULL};
    new_node->next = p->next;
    p->next = new_node;
}
void print_list(Node *head){
    head = head->next;
   while(head){
       cout<<head->data<<' ';
       head = head->next;
   }
}
Node *find(Node *head, int data){
    Node *p = head->next;
    while(p){
        if(p->data == data)
            return p;
        p = p->next;
    }
    return NULL;
}
void delete_after(Node *p){
    Node *q = p->next;
    p->next = q->next;
    delete q;
}
int main() {
    Node *head = new Node{0,NULL};
    for(int i=1;i<=10;i++){
    	 insert(head,i);
	}
    print_list(head);
    return 0;
}