链表（结点插入删除创造输出）

结点的创造，插入，删除，输出函数，以及主函数打印示例

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
typedef struct Node {
	int data;
	struct Node* next;
};
Node* getnewNode(int val) {
	Node* p = (Node*)malloc(sizeof(Node));
	p->data = val;
	p->next = NULL;
	return p;
};
 
Node* insert(Node* head, int pos, int val) {
	if (pos == 0) {
		Node* p = getnewNode(val);
		p->next = head;
		return p;
	}
	Node* p = head;
	for (int i = 1; i < pos; i++) p = p->next;
	Node* node = getnewNode(val);
	node->next = p->next;
	p->next = node;
	return head;
 
}
void clear(Node* head) {
	if (head == NULL) return;
	for (Node* p = head, *q; p; p = q) {
		q = p->next;
		free(p);
	}
	return;
}
void output_linklist(Node* head) {
	int n = 0;
	for (Node* p = head; p; p = p->next) n += 1;
	for (int i = 0; i < n; i++) {
		printf("%3d", i);
		printf("  ");
	}
	printf("\n");
	for (Node* p = head; p; p = p->next) {
		printf("%3d", p->data);
		printf("->");
	}
		printf("\n\n");
}
int find(Node*head,int val){
	int n=0;
	for(Node*p=head;p;p=p->next){
		if(p->data==val){
			output_linklist(head);
			for(int i=0;i<n*5;i++) printf(" ");
			printf("  ^");
			printf("\n");
			return 1;
		}
		n=n+1;
		
	}
	return 0;
} 
int main() {
	srand(time(0));
#define MAX_OP 7
	Node* head = NULL;
	for (int i = 0; i < MAX_OP; i++) {
		int pos = rand() % (i + 1), val = rand() % 100;
		printf("insert %d at %d to linked\n", val, pos);
		head = insert(head, pos, val);
		output_linklist(head);
		if(!find(head,val)){
			printf("Not Found");
		}
	}
	
	return 0;
}

运行结果