编辑代码

#include <stdio.h>
#include <stdlib.h>
struct Node{
    int data;
    struct Node* prev;     //指向前一个节点的节点指针
    struct Node* next;     //指向后一个节点的节点指针
};
struct Node* head = NULL;   //头节点

//创建新节点
struct Node* GetNewNode(int x){
	struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
	newNode -> data = x;
	newNode -> next = NULL;
	newNode -> prev = NULL;
	return newNode;
}

//头部插入节点
void InsertAtHead(int x){
	struct Node* newNode = GetNewNode(x);
	if(head == NULL){
		head = newNode;
        Print();
		return;
	}
	newNode -> next = head;
	head -> prev = newNode;
	head = newNode;
    Print();
}

//尾部插入节点
void InsertAtTail(int x){
	struct Node* newNode = GetNewNode(x);
	if(head == NULL){
		head = newNode;
        Print();
		return;
	}
	struct Node* temp = head;
	while(temp -> next != NULL){
		temp = temp -> next;
	}
	temp -> next = newNode;
	newNode -> prev = temp;
    Print();
}

//遍历打印链表节点
void Print(){
    struct Node* temp = head;
    while(temp != NULL){
        printf("%d ",temp -> data);
        temp = temp -> next;
    }
    printf("\n");
}

int main () {
    InsertAtHead(1);
    InsertAtHead(5);
    InsertAtHead(9);
    InsertAtTail(16);
    InsertAtTail(8);
    InsertAtTail(6);
}