Ch04 Lab - 단순 연결 리스트

📘 교재 예제 (Code)

📘 Textbook Examples (Code)

Code04-01.py

노드 5개를 생성하여 단순 연결 리스트를 만듭니다

class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

node1 = Node()
node1.data = "다현"

node2 = Node()
node2.data = "정연"
node1.link = node2

node3 = Node()
node3.data = "쯔위"
node2.link = node3

node4 = Node()
node4.data = "사나"
node3.link = node4

node5 = Node()
node5.data = "지효"
node4.link = node5

print(node1.data, end = ' ')
print(node1.link.data, end = ' ')
print(node1.link.link.data, end = ' ')
print(node1.link.link.link.data, end = ' ')
print(node1.link.link.link.link.data, end = ' ')

Code04-01.py

Creates 5 nodes to build a singly linked list

class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

node1 = Node()
node1.data = "Dahyun"

node2 = Node()
node2.data = "Jungyeon"
node1.link = node2

node3 = Node()
node3.data = "Tzuyu"
node2.link = node3

node4 = Node()
node4.data = "Sana"
node3.link = node4

node5 = Node()
node5.data = "Jihyo"
node4.link = node5

print(node1.data, end = ' ')
print(node1.link.data, end = ' ')
print(node1.link.link.data, end = ' ')
print(node1.link.link.link.data, end = ' ')
print(node1.link.link.link.link.data, end = ' ')

Code04-02.py

연결 리스트를 반복문으로 생성합니다

class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

node1 = Node()
node1.data = "다현"

node2 = Node()
node2.data = "정연"
node1.link = node2

node3 = Node()
node3.data = "쯔위"
node2.link = node3

node4 = Node()
node4.data = "사나"
node3.link = node4

node5 = Node()
node5.data = "지효"
node4.link = node5

current = node1
print(current.data, end = ' ')
while current.link != None :
	 current = current.link
	 print(current.data, end = ' ')

Code04-02.py

Creates a linked list using a loop

class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

node1 = Node()
node1.data = "Dahyun"

node2 = Node()
node2.data = "Jungyeon"
node1.link = node2

node3 = Node()
node3.data = "Tzuyu"
node2.link = node3

node4 = Node()
node4.data = "Sana"
node3.link = node4

node5 = Node()
node5.data = "Jihyo"
node4.link = node5

current = node1
print(current.data, end = ' ')
while current.link != None :
	 current = current.link
	 print(current.data, end = ' ')

Code04-03.py

연결 리스트의 노드를 순회하며 출력합니다

class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

node1 = Node()
node1.data = "다현"

node2 = Node()
node2.data = "정연"
node1.link = node2

node3 = Node()
node3.data = "쯔위"
node2.link = node3

node4 = Node()
node4.data = "사나"
node3.link = node4

node5 = Node()
node5.data = "지효"
node4.link = node5

newNode = Node()
newNode.data = "재남"
newNode.link = node2.link   # 정연의 링크
node2.link = newNode

current = node1
print(current.data, end = ' ')
while current.link != None :
	 current = current.link
	 print(current.data, end = ' ')

Code04-03.py

Traverses and prints nodes of a linked list

class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

node1 = Node()
node1.data = "Dahyun"

node2 = Node()
node2.data = "Jungyeon"
node1.link = node2

node3 = Node()
node3.data = "Tzuyu"
node2.link = node3

node4 = Node()
node4.data = "Sana"
node3.link = node4

node5 = Node()
node5.data = "Jihyo"
node4.link = node5

newNode = Node()
newNode.data = "Jaenam"
newNode.link = node2.link   # Jungyeon's link
node2.link = newNode

current = node1
print(current.data, end = ' ')
while current.link != None :
	 current = current.link
	 print(current.data, end = ' ')

Code04-04.py

연결 리스트에서 특정 노드를 검색합니다

class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

node1 = Node()
node1.data = "다현"

node2 = Node()
node2.data = "정연"
node1.link = node2

node3 = Node()
node3.data = "쯔위"
node2.link = node3

node4 = Node()
node4.data = "사나"
node3.link = node4

node5 = Node()
node5.data = "지효"
node4.link = node5

node2.link = node3.link 	# 쯔위의 링크를 정연의 링크로 복사
del(node3) 		# 쯔위 삭제

current = node1
print(current.data, end = ' ')
while current.link != None :
	 current = current.link
	 print(current.data, end = ' ')

Code04-04.py

Searches for a specific node in a linked list

class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

node1 = Node()
node1.data = "Dahyun"

node2 = Node()
node2.data = "Jungyeon"
node1.link = node2

node3 = Node()
node3.data = "Tzuyu"
node2.link = node3

node4 = Node()
node4.data = "Sana"
node3.link = node4

node5 = Node()
node5.data = "Jihyo"
node4.link = node5

node2.link = node3.link 	# Copy Tzuyu's link to Jungyeon's link
del(node3) 		# Delete Tzuyu

current = node1
print(current.data, end = ' ')
while current.link != None :
	 current = current.link
	 print(current.data, end = ' ')

Code04-05.py

연결 리스트의 첫 번째 위치에 노드를 삽입합니다

## 클래스와 함수 선언 부분 ##
class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

def printNodes(start) :

	current = start
	if current == None :
		return
	print(current.data, end = ' ')
	while current.link != None:
		current = current.link
		print(current.data, end = ' ')
	print()

## 전역 변수 선언 부분 ##
memory = []
head, current, pre = None, None, None
dataArray = ["다현", "정연", "쯔위", "사나", "지효"]

## 메인 코드 부분 ##

if __name__ == "__main__" :

	node = Node()		# 첫 번째 노드
	node.data = dataArray[0]
	head = node
	memory.append(node)

	for data in dataArray[1:] :	# 두 번째 이후 노드
		pre = node
		node = Node()
		node.data = data
		pre.link = node
		memory.append(node)

	printNodes(head)

Code04-05.py

Inserts a node at the first position of a linked list

## Class & Function Declarations ##
class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

def printNodes(start) :

	current = start
	if current == None :
		return
	print(current.data, end = ' ')
	while current.link != None:
		current = current.link
		print(current.data, end = ' ')
	print()

## Global Variables ##
memory = []
head, current, pre = None, None, None
dataArray = ["Dahyun", "Jungyeon", "Tzuyu", "Sana", "Jihyo"]

## Main Code ##
if __name__ == "__main__" :

	node = Node()		# First node
	node.data = dataArray[0]
	head = node
	memory.append(node)

	for data in dataArray[1:] :	# From the second node onward
		pre = node
		node = Node()
		node.data = data
		pre.link = node
		memory.append(node)

	printNodes(head)

Code04-06.py

연결 리스트의 중간/마지막에 노드를 삽입합니다

## 클래스와 함수 선언 부분 ##
class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

def printNodes(start) :

	current = start
	if current == None :
		return
	print(current.data, end = ' ')
	while current.link != None:
		current = current.link
		print(current.data, end = ' ')
	print()

def insertNode(findData, insertData) :

	global memory, head, current, pre

	if head.data == findData :      # 첫 번째 노드 삽입
		node = Node()
		node.data = insertData
		node.link = head
		head = node
		return

	current = head
	while current.link != None :    # 중간 노드 삽입
		pre = current
		current = current.link
		if current.data == findData :
			node = Node()
			node.data = insertData
			node.link = current
			pre.link = node
			return

	node = Node()                   # 마지막 노드 삽입
	node.data = insertData
	current.link = node

## 전역 변수 선언 부분 ##
memory = []
head, current, pre = None, None, None
dataArray = ["다현", "정연", "쯔위", "사나", "지효"]

## 메인 코드 부분 ##

if __name__ == "__main__" :

	node = Node()			# 첫 번째 노드
	node.data = dataArray[0]
	head = node
	memory.append(node)

	for data in dataArray[1:] :		# 두 번째 노드부터
		pre = node
		node = Node()
		node.data = data
		pre.link = node
		memory.append(node)

	printNodes(head)

	insertNode("다현", "화사")
	printNodes(head)

	insertNode("사나", "솔라")
	printNodes(head)

	insertNode("재남", "문별")
	printNodes(head)

Code04-06.py

Inserts a node in the middle or at the end of a linked list

## Class & Function Declarations ##
class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

def printNodes(start) :

	current = start
	if current == None :
		return
	print(current.data, end = ' ')
	while current.link != None:
		current = current.link
		print(current.data, end = ' ')
	print()

def insertNode(findData, insertData) :

	global memory, head, current, pre

	if head.data == findData :      # Insert before the first node
		node = Node()
		node.data = insertData
		node.link = head
		head = node
		return

	current = head
	while current.link != None :    # Insert in the middle
		pre = current
		current = current.link
		if current.data == findData :
			node = Node()
			node.data = insertData
			node.link = current
			pre.link = node
			return

	node = Node()                   # Insert at the end
	node.data = insertData
	current.link = node

## Global Variables ##
memory = []
head, current, pre = None, None, None
dataArray = ["Dahyun", "Jungyeon", "Tzuyu", "Sana", "Jihyo"]

## Main Code ##
if __name__ == "__main__" :

	node = Node()			# First node
	node.data = dataArray[0]
	head = node
	memory.append(node)

	for data in dataArray[1:] :		# From the second node onward
		pre = node
		node = Node()
		node.data = data
		pre.link = node
		memory.append(node)

	printNodes(head)

	insertNode("Dahyun", "Hwasa")
	printNodes(head)

	insertNode("Sana", "Solar")
	printNodes(head)

	insertNode("Jaenam", "Moonbyul")
	printNodes(head)

Code04-07.py

연결 리스트의 첫 번째 노드를 삭제합니다

## 클래스와 함수 선언 부분 ##
class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

def printNodes(start) :

	current = start
	if current == None :
		return
	print(current.data, end = ' ')
	while current.link != None:
		current = current.link
		print(current.data, end = ' ')
	print()

def deleteNode(deleteData) :

	global memory, head, current, pre

	if head.data == deleteData :         # 첫 번째 노드 삭제
		current = head
		head = head.link
		del(current)
		return

	current = head                          # 첫 번째  외 노드 삭제
	while current.link != None :
		pre = current
		current = current.link
		if current.data == deleteData :
			pre.link = current.link
			del(current)
			return

## 전역 변수 선언 부분 ##
memory = []
head, current, pre = None, None, None
dataArray = ["다현", "정연", "쯔위", "사나", "지효"]

## 메인 코드 부분 ##

if __name__ == "__main__" :

	node = Node()			# 첫 번째 노드
	node.data = dataArray[0]
	head = node
	memory.append(node)

	for data in dataArray[1:] :		# 두 번째 노드부터
		pre = node
		node = Node()
		node.data = data
		pre.link = node
		memory.append(node)

	printNodes(head)

	deleteNode("다현")
	printNodes(head)

	deleteNode("쯔위")
	printNodes(head)

	deleteNode("지효")
	printNodes(head)

	deleteNode("재남")
	printNodes(head)

Code04-07.py

Deletes the first node of a linked list

## Class & Function Declarations ##
class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

def printNodes(start) :

	current = start
	if current == None :
		return
	print(current.data, end = ' ')
	while current.link != None:
		current = current.link
		print(current.data, end = ' ')
	print()

def deleteNode(deleteData) :

	global memory, head, current, pre

	if head.data == deleteData :         # Delete the first node
		current = head
		head = head.link
		del(current)
		return

	current = head                          # Delete a non-first node
	while current.link != None :
		pre = current
		current = current.link
		if current.data == deleteData :
			pre.link = current.link
			del(current)
			return

## Global Variables ##
memory = []
head, current, pre = None, None, None
dataArray = ["Dahyun", "Jungyeon", "Tzuyu", "Sana", "Jihyo"]

## Main Code ##
if __name__ == "__main__" :

	node = Node()			# First node
	node.data = dataArray[0]
	head = node
	memory.append(node)

	for data in dataArray[1:] :		# From the second node onward
		pre = node
		node = Node()
		node.data = data
		pre.link = node
		memory.append(node)

	printNodes(head)

	deleteNode("Dahyun")
	printNodes(head)

	deleteNode("Tzuyu")
	printNodes(head)

	deleteNode("Jihyo")
	printNodes(head)

	deleteNode("Jaenam")
	printNodes(head)

Code04-08.py

연결 리스트의 중간/마지막 노드를 삭제합니다

## 클래스와 함수 선언 부분 ##
class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

def printNodes(start) :

	current = start
	if current == None :
		return
	print(current.data, end = ' ')
	while current.link != None:
		current = current.link
		print(current.data, end = ' ')
	print()

def findNode(findData) :

	global memory, head, current, pre

	current = head
	if current.data == findData :
		return current
	while current.link != None :
		current = current.link
		if current.data == findData :
			return current
	return Node()	# 빈 노드 반환

## 전역 변수 선언 부분 ##
memory = []
head, current, pre = None, None, None
dataArray = ["다현", "정연", "쯔위", "사나", "지효"]

## 메인 코드 부분 ##

if __name__ == "__main__" :

	node = Node()			# 첫 번째 노드
	node.data = dataArray[0]
	head = node
	memory.append(node)

	for data in dataArray[1:] :		# 두 번째 노드부터
		pre = node
		node = Node()
		node.data = data
		pre.link = node
		memory.append(node)

	printNodes(head)

	fNode = findNode("다현")
	print(fNode.data)

	fNode = findNode("쯔위")
	print(fNode.data)

	fNode = findNode("재남")
	print(fNode.data)

Code04-08.py

Deletes a middle or last node from a linked list

## Class & Function Declarations ##
class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

def printNodes(start) :

	current = start
	if current == None :
		return
	print(current.data, end = ' ')
	while current.link != None:
		current = current.link
		print(current.data, end = ' ')
	print()

def findNode(findData) :

	global memory, head, current, pre

	current = head
	if current.data == findData :
		return current
	while current.link != None :
		current = current.link
		if current.data == findData :
			return current
	return Node()	# Return empty node

## Global Variables ##
memory = []
head, current, pre = None, None, None
dataArray = ["Dahyun", "Jungyeon", "Tzuyu", "Sana", "Jihyo"]

## Main Code ##
if __name__ == "__main__" :

	node = Node()			# First node
	node.data = dataArray[0]
	head = node
	memory.append(node)

	for data in dataArray[1:] :		# From the second node onward
		pre = node
		node = Node()
		node.data = data
		pre.link = node
		memory.append(node)

	printNodes(head)

	fNode = findNode("Dahyun")
	print(fNode.data)

	fNode = findNode("Tzuyu")
	print(fNode.data)

	fNode = findNode("Jaenam")
	print(fNode.data)

Code04-09.py

연결 리스트의 삽입/삭제 통합 프로그램입니다

## 클래스와 함수 선언 부분 ##
class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

def printNodes(start) :

	current = start
	if current == None :
		return
	print(current.data, end = ' ')
	while current.link != None:
		current = current.link
		print(current.data, end = ' ')
	print()

def makeSimpleLinkedList(namePhone) :

	global memory, head, current, pre
	printNodes(head)

	node = Node()
	node.data = namePhone
	memory.append(node)
	if head == None :			# 첫 번째 노드일 때
		head = node
		return

	if head.data[0] > namePhone[0] :	# 첫 번째 노드보다 작을 때
		node.link = head
		head = node
		return

	# 중간 노드로 삽입하는 경우
	current = head
	while current.link != None :
		pre = current
		current = current.link
		if current.data[0] > namePhone[0]:
			pre.link = node
			node.link = current
			return

	# 삽입하는 노드가 가장 큰 경우
	current.link = node

## 전역 변수 선언 부분 ##
memory = []
head, current, pre = None, None, None
dataArray = [["지민", "010-1111-1111"], ["정국", "010-2222-2222"], ["뷔", "010-3333-3333"], ["슈가", "010-4444-4444"], ["진", "010-5555-5555"]]

## 메인 코드 부분 ##

if __name__ == "__main__" :

	for data in dataArray :
		makeSimpleLinkedList(data)

	printNodes(head)

Code04-09.py

Complete linked list program with insert and delete operations

## Class & Function Declarations ##
class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

def printNodes(start) :

	current = start
	if current == None :
		return
	print(current.data, end = ' ')
	while current.link != None:
		current = current.link
		print(current.data, end = ' ')
	print()

def makeSimpleLinkedList(namePhone) :

	global memory, head, current, pre
	printNodes(head)

	node = Node()
	node.data = namePhone
	memory.append(node)
	if head == None :			# When it is the first node
		head = node
		return

	if head.data[0] > namePhone[0] :	# When smaller than the first node
		node.link = head
		head = node
		return

	# Case: insert as middle node
	current = head
	while current.link != None :
		pre = current
		current = current.link
		if current.data[0] > namePhone[0]:
			pre.link = node
			node.link = current
			return

	# When the inserting node is the largest
	current.link = node

## Global Variables ##
memory = []
head, current, pre = None, None, None
dataArray = [["Jimin", "010-1111-1111"], ["Jungkook", "010-2222-2222"], ["V", "010-3333-3333"], ["Suga", "010-4444-4444"], ["Jin", "010-5555-5555"]]

## Main Code ##
if __name__ == "__main__" :

	for data in dataArray :
		makeSimpleLinkedList(data)

	printNodes(head)

📗 응용 예제 (Ex)

📗 Applied Examples (Ex)

Ex04-01.py

연결 리스트를 활용한 친구 관리 프로그램입니다

## 클래스와 함수 선언 부분 ##
class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

def printNodes(start) :

	current = start
	if current == None :
		return
	print(current.data, end=' ')
	while current.link != None:
		current = current.link
		print(current.data, end=' ')
	print()

def makeSimpleLinkedList(nameEmail) :

	global memory, head, current, pre

	node = Node()
	node.data = nameEmail
	memory.append(node)
	if head == None :		# 첫 번째 노드
		head = node
		return

	if head.data[1] > nameEmail[1] :
		node.link = head
		head = node
		return

	current = head
	while current.link != None :
		pre = current
		current = current.link
		if current.data[1] > nameEmail[1]:
			pre.link = node
			node.link = current
			return

	current.link = node

## 전역 변수 선언 부분 ##
memory = []
head, current, pre = None, None, None

## 메인 코드 부분 ##

if __name__ == "__main__" :

	while True:
		name = input("이름--> ")
		if name == "" or name == None :
			break
		email = input("이메일--> ")
		makeSimpleLinkedList([name, email])
		printNodes(head)

Ex04-01.py

Friend management program using a linked list

## Class & Function Declarations ##
class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

def printNodes(start) :

	current = start
	if current == None :
		return
	print(current.data, end=' ')
	while current.link != None:
		current = current.link
		print(current.data, end=' ')
	print()

def makeSimpleLinkedList(nameEmail) :

	global memory, head, current, pre

	node = Node()
	node.data = nameEmail
	memory.append(node)
	if head == None :		# First node
		head = node
		return

	if head.data[1] > nameEmail[1] :
		node.link = head
		head = node
		return

	current = head
	while current.link != None :
		pre = current
		current = current.link
		if current.data[1] > nameEmail[1]:
			pre.link = node
			node.link = current
			return

	current.link = node

## Global Variables ##
memory = []
head, current, pre = None, None, None

## Main Code ##
if __name__ == "__main__" :

	while True:
		name = input("Name--> ")
		if name == "" or name == None :
			break
		email = input("Email--> ")
		makeSimpleLinkedList([name, email])
		printNodes(head)

Ex04-02.py

랜덤 데이터로 연결 리스트를 생성하고 정렬 삽입합니다

import random

## 클래스와 함수 선언 부분 ##
class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

def printNodes(start) :

	current = start
	if current == None :
		return
	print(current.data, end=' ')
	while current.link != None:
		current = current.link
		print(current.data, end=' ')
	print()

def makeLottoList(num) :

	global memory, head, current, pre

	node = Node()
	node.data = num
	memory.append(node)
	if head == None :		# 첫 번째 노드
		head = node
		return

	if head.data > num :
		node.link = head
		head = node
		return

	current = head
	while current.link != None :
		pre = current
		current = current.link
		if current.data > num:
			pre.link = node
			node.link = current
			return

	current.link = node

def  findNumber(num) :

	global memory, head, current, pre

	if head == None :
		return False
	current = head
	if current.data == num:
		return True
	while current.link != None:
		current = current.link
		if current.data == num:
			return True
	return False

## 전역 변수 선언 부분 ##
memory = []
head, current, pre = None, None, None

## 메인 코드 부분 ##

if __name__ == "__main__" :

	lottoCount = 0
	while True:
		lotto = random.randint(1,45)
		if findNumber(lotto) :
			continue
		lottoCount += 1
		makeLottoList(lotto)
		if lottoCount >= 6 :
			break

	printNodes(head)

Ex04-02.py

Creates a linked list with random data using sorted insertion

import random

## Class & Function Declarations ##
class Node() :
	def __init__ (self) :
		self.data = None
		self.link = None

def printNodes(start) :

	current = start
	if current == None :
		return
	print(current.data, end=' ')
	while current.link != None:
		current = current.link
		print(current.data, end=' ')
	print()

def makeLottoList(num) :

	global memory, head, current, pre

	node = Node()
	node.data = num
	memory.append(node)
	if head == None :		# First node
		head = node
		return

	if head.data > num :
		node.link = head
		head = node
		return

	current = head
	while current.link != None :
		pre = current
		current = current.link
		if current.data > num:
			pre.link = node
			node.link = current
			return

	current.link = node

def  findNumber(num) :

	global memory, head, current, pre

	if head == None :
		return False
	current = head
	if current.data == num:
		return True
	while current.link != None:
		current = current.link
		if current.data == num:
			return True
	return False

## Global Variables ##
memory = []
head, current, pre = None, None, None

## Main Code ##
if __name__ == "__main__" :

	lottoCount = 0
	while True:
		lotto = random.randint(1,45)
		if findNumber(lotto) :
			continue
		lottoCount += 1
		makeLottoList(lotto)
		if lottoCount >= 6 :
			break

	printNodes(head)

📙 자가 실습 (Self)

📙 Self Practice (Self)

Self04-01.py

연결 리스트의 노드 삭제 기능을 직접 구현합니다

## 클래스 및 함수 선언부 ##
class Node() :
    def __init__ (self) :
        self.data = None
        self.link = None

def printNodes(start) :

    current = start
    if current == None :
        return
    print(current.data, end=' ')
    while current.link != None:
        current = current.link
        print(current.data, end=' ')
    print()

def deleteNode(deleteData) :

    global memory, head, current, pre

    if head.data == deleteData : # 첫 노드가 삭제할 노드일 때
        current = head
        head = head.link
        del(current)
        print("# 첫 노드가 삭제됨 #")
        return

    current = head
    while current.link != None :
        pre = current
        current = current.link
        if current.data == deleteData :
            pre.link = current.link
            del(current)
            print("# 중간 노드가 삭제됨 #")
            return

    print("# 삭제된 노드가 없음 #")

## 전역 변수 선언부
memory = []
head, current, pre = None, None, None
dataArray = ["다현", "정연", "쯔위", "사나", "지효"]

## 메인 코드부

if __name__ == "__main__" :

    # 첫번째 노드
    node = Node()
    node.data = dataArray[0]
    head = node
    memory.append(node)

    # 두번째 노드 부터
    for data in dataArray[1:] :
        pre = node
        node = Node()
        node.data = data
        pre.link = node
        memory.append(node)

    printNodes(head)

    deleteNode("다현")
    printNodes(head)

    deleteNode("쯔위")
    printNodes(head)

    deleteNode("사나")
    printNodes(head)

    deleteNode("재남")
    printNodes(head)

Self04-01.py

Implements linked list node deletion yourself

## Class & Function Declarations ##
class Node() :
    def __init__ (self) :
        self.data = None
        self.link = None

def printNodes(start) :

    current = start
    if current == None :
        return
    print(current.data, end=' ')
    while current.link != None:
        current = current.link
        print(current.data, end=' ')
    print()

def deleteNode(deleteData) :

    global memory, head, current, pre

    if head.data == deleteData : # When the first node is the one to delete
        current = head
        head = head.link
        del(current)
        print("# First node deleted #")
        return

    current = head
    while current.link != None :
        pre = current
        current = current.link
        if current.data == deleteData :
            pre.link = current.link
            del(current)
            print("# Middle node deleted #")
            return

    print("# No node was deleted #")

## Global Variables
memory = []
head, current, pre = None, None, None
dataArray = ["Dahyun", "Jungyeon", "Tzuyu", "Sana", "Jihyo"]

## Main Code
if __name__ == "__main__" :

    # First node
    node = Node()
    node.data = dataArray[0]
    head = node
    memory.append(node)

    # From the second node onward
    for data in dataArray[1:] :
        pre = node
        node = Node()
        node.data = data
        pre.link = node
        memory.append(node)

    printNodes(head)

    deleteNode("Dahyun")
    printNodes(head)

    deleteNode("Tzuyu")
    printNodes(head)

    deleteNode("Sana")
    printNodes(head)

    deleteNode("Jaenam")
    printNodes(head)

Self04-02.py

연결 리스트의 노드 삽입 기능을 직접 구현합니다

## 클래스 및 함수 선언부 ##
class Node() :
    def __init__ (self) :
        self.data = None
        self.link = None

def printNodes(start) :

    current = start
    if current == None :
        return
    print(current.data, end=' ')
    while current.link != None:
        current = current.link
        print(current.data, end=' ')
    print()

def makeSimpleLinkedList(nameAge) :

    global memory, head, current, pre
    printNodes(head)

    node = Node()
    node.data = nameAge
    memory.append(node)
    if head == None : # 첫 노드
        head = node
        return

    if head.data[1] > nameAge[1] : # 첫 노드 보다 작을 때
        node.link = head
        head = node
        return

    # 중간 노드에 삽입하는 경우
    current = head
    while current.link != None :
        pre = current
        current = current.link
        if current.data[1] > nameAge[1]:
            pre.link = node
            node.link = current
            return

    # 입력하는 노드가 제일 큰 경우
    current.link = node

## 전역 변수 선언부
memory = []
head, current, pre = None, None, None
dataArray = [["지민", 180], ["정국", 177], ["뷔", 183], ["슈가", 175], ["진", 179]]

## 메인 코드부

if __name__ == "__main__" :

    for data in dataArray :
        makeSimpleLinkedList(data)

    printNodes(head)