数据结构代码_Linked List(链表)

PS:这是在CodeBlocks运行，在VS上不知道为什么运行不了

Linked List (链表)

从头插入节点

//Linked List:Inserting a node at beginnnig
#include<stdlib.h>
#include<stdio.h>
struct Node {
	int data;
	struct Node* next;
};
struct Node* head;//global variable,can be accessed anywhere
void Insert(int x)
{
	struct Node* temp = (Node*)malloc(sizeof(struct Node));
		temp->data = x;
		//temp->next = NULL;
		//if (head != NULL)temp->next = head;
		temp->next = head;
		head = temp;
}
void Print() {
	struct Node* temp = head;
	printf("List is: ");
	while (temp != NULL)
	{
		printf(" %d", temp->data);
		temp = temp->next;
	}
	printf("\n");
}
int main() {
	head = NULL; //empty list
	printf("How many numbers?\n");
	int n,i,x;
	scanf("%d", &n);
	for (i = 0; i < n; i++) {
		printf("Enter the number \n");
		scanf("%d", &x);
		Insert(x);
		Print();
	}
}

运行结果：

从任意位置插入节点

//Linked List:Inserting a node at beginnnig
#include<stdlib.h>
#include<stdio.h>
struct Node {
	int data;
	struct Node* next;
};
struct Node* head;//global variable,can be accessed anywhere
void Insert(int data,int n)
{
	Node* temp1=new Node();
	temp1->data=data;
	temp1->next=NULL;
	if(n==1){
        temp1->next =head;
        head=temp1;
        return;
    }
    Node* temp2 =head;
    for(int i=0;i<n-2;i++)
    {

        temp2=temp2->next;
    }
    temp1->next =temp2->next;
    temp2->next=temp1;
}
void Print() {
	Node* temp=head;
	while(temp!=NULL){
        printf("%d",temp->data);
        temp=temp->next;
	}
	printf("\n");
}
int main() {
	head = NULL; //empty list
	Insert(2,1);
	//Insert(3,2);
	Insert(4,1);
	Insert(6,2);
	Insert(9,3);
    Print();

}

运行结果：
改main函数里的Insert()参数会有不一样的效果