05장 연결리스트 3 – 양방향 연결리스트

Posted on: 2019년 03월 10일 2019년 03월 10일
Categories: 강의자료, 자료구조

양방향 연결리스트(Double Linked List) 구현 #1 : S005_DoubleLinkedList.c

#include <stdio.h>
#include <stdlib.h>

typedef struct _node{
	int data;
	struct _node *next;
	struct _node *prev;
} Node;

Node *head = NULL;

void main(int argc, char* argv[]){
}

#include <stdio.h>

#include <stdlib.h>

typedef struct _node{

int data;

struct _node *next;

struct _node *prev;

} Node;

Node *head = NULL;

void main(int argc, char* argv[]){

}

양방향 연결리스트(Double Linked List) 구현 #2

void Free(){ Node *cur; while(head != NULL) { cur = head; head = head->next; free(cur); } } void main(int argc, char* argv[]){ Free(); }

1
2
3
4
5
6
7
8
9
10
11
12
13

void Free(){
Node *cur;

while(head != NULL) {
cur = head;
head = head->next;
free(cur);
}
}

void main(int argc, char* argv[]){
Free();
}

양방향 연결리스트(Double Linked List) 구현 #3

void Insert(int data){
	Node *cur;

	Node *newNode = (Node *)malloc(sizeof(Node));
	newNode->data = data;
	newNode->next = NULL;
	newNode->prev = NULL;

	if(head == NULL){
		head = newNode;
	}
	else{
		Node *cur = head;
		cur->prev = newNode;
		newNode->next = cur;
		head = newNode;
	}
}

void main(int argc, char* argv[]){
	Insert(15);
	Free();
}

void Insert(int data){

Node *cur;

Node *newNode = (Node *)malloc(sizeof(Node));

newNode->data = data;

newNode->next = NULL;

newNode->prev = NULL;

if(head == NULL){

head = newNode;

}

else{

Node *cur = head;

cur->prev = newNode;

newNode->next = cur;

head = newNode;

}

void main(int argc, char* argv[]){

Insert(15);

Free();

}

양방향 연결리스트(Double Linked List) 구현 #4

void PrintList(){
	Node *cur = head;
	while(cur != NULL){
		printf("%d  ", cur->data);
		cur = cur->next;
	}
	printf("\n\n");
}

void PrintListRev(){
	Node *cur = head;
	Node *curPrev = NULL;
	while(cur != NULL){
		curPrev = cur;
		cur = cur->next;
	}
	while(curPrev != NULL){
		printf("%d  ", curPrev->data);
		curPrev = curPrev->prev;
	}

	printf("\n\n");
}

void main(int argc, char* argv[]){
	Insert(15);  	PrintList();	PrintListRev();
	Insert(12);		PrintList();	PrintListRev();
	Free();
}

void PrintList(){

Node *cur = head;

while(cur != NULL){

printf("%d ", cur->data);

cur = cur->next;

}

printf("\n\n");

}

void PrintListRev(){

Node *cur = head;

Node *curPrev = NULL;

while(cur != NULL){

curPrev = cur;

cur = cur->next;

}

while(curPrev != NULL){

printf("%d ", curPrev->data);

curPrev = curPrev->prev;

}

printf("\n\n");

}

void main(int argc, char* argv[]){

Insert(15); PrintList(); PrintListRev();

Insert(12); PrintList(); PrintListRev();

Free();

}

양방향 연결리스트(Double Linked List) 구현 #5

void RemoveData(int data){
	int n = 0;
	if(head == NULL){
		printf("리스트가 비어있어 삭제할 수 없습니다.\n");
		return;
	}
	else{
		Node *cur = head;
		Node *curNext = head->next;
		if(cur->data == data){
			free(cur);
			if(curNext != NULL)
				curNext->prev = NULL;
			head = curNext;
			printf("%d번째 위치에서 %d를삭제했습니다.\n", n, data);
			return;
		}
		else{
			while(cur->next != NULL){
				n++;
				if(curNext->data == data){
					cur->next = curNext->next;
					Node *curNextNext = curNext->next;
					if(curNextNext != NULL)
						curNextNext->prev = curNext->prev;
					free(curNext);
					printf("%d번째 위치에서 %d를삭제했습니다.\n", n, data);
					return;
				}
				cur = cur->next;
				curNext = curNext->next;
			}
			printf("리스트에 %d가 존재하지 않습니다.\n", data);
		}
	}
}

void main(int argc, char* argv[]){
	Insert(15);  	PrintList();	PrintListRev();
	Insert(12);		PrintList();	PrintListRev();
	Insert(36);		PrintList();	PrintListRev();
	Insert(22);		PrintList();	PrintListRev();
	Insert(32);		PrintList();	PrintListRev();

	RemoveData(36);	PrintList();	PrintListRev();
	RemoveData(32);	PrintList();	PrintListRev();
	RemoveData(22);	PrintList();	PrintListRev();
	RemoveData(15);	PrintList();	PrintListRev();
	RemoveData(12);	PrintList();	PrintListRev();
	Free();
}

void RemoveData(int data){

int n = 0;

if(head == NULL){

printf("리스트가 비어있어 삭제할 수 없습니다.\n");

return;

}

else{

Node *cur = head;

Node *curNext = head->next;

if(cur->data == data){

free(cur);

if(curNext != NULL)

curNext->prev = NULL;

head = curNext;

printf("%d번째 위치에서 %d를삭제했습니다.\n", n, data);

return;

}

else{

while(cur->next != NULL){

n++;

if(curNext->data == data){

cur->next = curNext->next;

Node *curNextNext = curNext->next;

if(curNextNext != NULL)

curNextNext->prev = curNext->prev;

free(curNext);

printf("%d번째 위치에서 %d를삭제했습니다.\n", n, data);

return;

}

cur = cur->next;

curNext = curNext->next;

}

printf("리스트에 %d가 존재하지 않습니다.\n", data);

}

void main(int argc, char* argv[]){

Insert(15); PrintList(); PrintListRev();

Insert(12); PrintList(); PrintListRev();

Insert(36); PrintList(); PrintListRev();

Insert(22); PrintList(); PrintListRev();

Insert(32); PrintList(); PrintListRev();

RemoveData(36); PrintList(); PrintListRev();

RemoveData(32); PrintList(); PrintListRev();

RemoveData(22); PrintList(); PrintListRev();

RemoveData(15); PrintList(); PrintListRev();

RemoveData(12); PrintList(); PrintListRev();

Free();

}

양방향 연결리스트(Double Linked List) 완성 버전

#include <stdio.h>
#include <stdlib.h>

typedef struct _node{
	int data;
	struct _node *next;
	struct _node *prev;
} Node;

Node *head = NULL;

void Insert(int data){
	Node *cur;

	Node *newNode = (Node *)malloc(sizeof(Node));
	newNode->data = data;
	newNode->next = NULL;
	newNode->prev = NULL;

	if(head == NULL){
		head = newNode;
	}
	else{
		Node *cur = head;
		cur->prev = newNode;
		newNode->next = cur;
		head = newNode;
	}
}

void RemoveData(int data){
	int n = 0;
	if(head == NULL){
		printf("리스트가 비어있어 삭제할 수 없습니다.\n");
		return;
	}
	else{
		Node *cur = head;
		Node *curNext = head->next;
		if(cur->data == data){
			free(cur);
			if(curNext != NULL)
				curNext->prev = NULL;
			head = curNext;
			printf("%d번째 위치에서 %d를삭제했습니다.\n", n, data);
			return;
		}
		else{
			while(cur->next != NULL){
				n++;
				if(curNext->data == data){
					cur->next = curNext->next;
					Node *curNextNext = curNext->next;
					if(curNextNext != NULL)
						curNextNext->prev = curNext->prev;
					free(curNext);
					printf("%d번째 위치에서 %d를삭제했습니다.\n", n, data);
					return;
				}
				cur = cur->next;
				curNext = curNext->next;
			}
			printf("리스트에 %d가 존재하지 않습니다.\n", data);
		}
	}
}

void PrintList(){
	Node *cur = head;
	while(cur != NULL){
		printf("%d  ", cur->data);
		cur = cur->next;
	}
	printf("\n\n");
}

void PrintListRev(){
	Node *cur = head;
	Node *curPrev = NULL;
	while(cur != NULL){
		curPrev = cur;
		cur = cur->next;
	}
	while(curPrev != NULL){
		printf("%d  ", curPrev->data);
		curPrev = curPrev->prev;
	}

	printf("\n\n");
}

void Free(){
	Node *cur;

	while(head != NULL)	{
		cur = head;
		head = head->next;
		free(cur);
	}
}

void main(int argc, char* argv[]){
	Insert(15);  	PrintList();	PrintListRev();
	Insert(12);		PrintList();	PrintListRev();
	Insert(36);		PrintList();	PrintListRev();
	Insert(22);		PrintList();	PrintListRev();
	Insert(32);		PrintList();	PrintListRev();

	RemoveData(36);	PrintList();	PrintListRev();
	RemoveData(32);	PrintList();	PrintListRev();
	RemoveData(20);	PrintList();	PrintListRev();
	RemoveData(22);	PrintList();	PrintListRev();
	RemoveData(15);	PrintList();	PrintListRev();
	RemoveData(12);	PrintList();	PrintListRev();
	Free();
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

#include <stdio.h>

#include <stdlib.h>

typedef struct _node{

int data;

struct _node *next;

struct _node *prev;

} Node;

Node *head = NULL;

void Insert(int data){

Node *cur;

Node *newNode = (Node *)malloc(sizeof(Node));

newNode->data = data;

newNode->next = NULL;

newNode->prev = NULL;

if(head == NULL){

head = newNode;

}

else{

Node *cur = head;

cur->prev = newNode;

newNode->next = cur;

head = newNode;

}

void RemoveData(int data){

int n = 0;

if(head == NULL){

printf("리스트가 비어있어 삭제할 수 없습니다.\n");

return;

}

else{

Node *cur = head;

Node *curNext = head->next;

if(cur->data == data){

free(cur);

if(curNext != NULL)

curNext->prev = NULL;

head = curNext;

printf("%d번째 위치에서 %d를삭제했습니다.\n", n, data);

return;

}

else{

while(cur->next != NULL){

n++;

if(curNext->data == data){

cur->next = curNext->next;

Node *curNextNext = curNext->next;

if(curNextNext != NULL)

curNextNext->prev = curNext->prev;

free(curNext);

printf("%d번째 위치에서 %d를삭제했습니다.\n", n, data);

return;

}

cur = cur->next;

curNext = curNext->next;

}

printf("리스트에 %d가 존재하지 않습니다.\n", data);

}

void PrintList(){

Node *cur = head;

while(cur != NULL){

printf("%d ", cur->data);

cur = cur->next;

}

printf("\n\n");

}

void PrintListRev(){

Node *cur = head;

Node *curPrev = NULL;

while(cur != NULL){

curPrev = cur;

cur = cur->next;

}

while(curPrev != NULL){

printf("%d ", curPrev->data);

curPrev = curPrev->prev;

}

printf("\n\n");

}

void Free(){

Node *cur;

while(head != NULL) {

cur = head;

head = head->next;

free(cur);

}

void main(int argc, char* argv[]){

Insert(15); PrintList(); PrintListRev();

Insert(12); PrintList(); PrintListRev();

Insert(36); PrintList(); PrintListRev();

Insert(22); PrintList(); PrintListRev();

Insert(32); PrintList(); PrintListRev();

RemoveData(36); PrintList(); PrintListRev();

RemoveData(32); PrintList(); PrintListRev();

RemoveData(20); PrintList(); PrintListRev();

RemoveData(22); PrintList(); PrintListRev();

RemoveData(15); PrintList(); PrintListRev();

RemoveData(12); PrintList(); PrintListRev();

Free();

}

whan0623

517