حذف عقدة من قائمة مترابطة - كتاب الذكاء الإصطناعي - الصف 12 - الفصل 1 - المملكة العربية السعودية

# single node class Node: def __init__(self, data = None, next = None): self.data = data self.next = next# linked list with one head node class LinkedList: def __init__(self): self.head = None def deleteNode(key, follow):# store the head node temp = follow.head# find the key to be deleted, # the trace of the previous node to be changed while(temp is not None): if temp.data == key: break prev = temp temp = temp.next# unlink the node from the linked list prev.next = temp.next temp = None--- SECTION: 1. اربط مؤشر العقدة 12 بالعقدة 99. --- 1. اربط مؤشر العقدة 12 بالعقدة 99.--- SECTION: 2. احذف العقدة 37. --- 2. احذف العقدة 37.--- SECTION: 3. النتيجة النهائية --- 3. النتيجة النهائية# create the linked list L_list = LinkedList()# add the first three nodes L_list.head = Node(12) second = Node(37) third = Node(99) L_list.head.next = second second.next = third# delete node 37 deleteNode(37, L_list)إذا كنت تريد حذف العقدة الأولى من القائمة المترابطة، عليك نقل مؤشر الرأس إلى العقدة الثانية من القائمة.# print the linked list node = L_list.head while node: print (node.data) node = node.next2023 - 1447--- VISUAL CONTEXT --- **DIAGRAM**: Untitled Description: A diagram showing an initial linked list of three nodes. The first node contains the value 12 and is labeled 'node'. It points to the second node, which contains 37 and is labeled 'node.next'. The second node points to the third node, which contains 99 and is labeled 'node.next.next'. Arrows indicate the 'next' pointers. Key Values: Node 1: 12, Node 2: 37, Node 3: 99 Context: This diagram illustrates the initial state of the linked list before any deletion operation, corresponding to the list creation in the Python code.**DIAGRAM**: Untitled Description: A diagram illustrating the process of deleting node 37. The first node (12, labeled 'node') now points directly to the third node (99, labeled 'node.next'), bypassing the second node. This new link is indicated by a dashed arrow labeled '1'. The second node (37, labeled 'node.next') is shown separately below, crossed out with a diagonal line, and labeled '2', indicating its removal from the list. Key Values: Node 1: 12, Node 2: 37 (deleted), Node 3: 99 Context: This diagram visually explains the two steps of deleting a node: first, updating the pointer of the preceding node to skip the node to be deleted, and second, conceptually removing the node from memory. This corresponds to instructions 1 and 2.**DIAGRAM**: النتيجة النهائية Description: A diagram showing the final state of the linked list after node 37 has been deleted. The list now consists of two nodes: the first node contains 12 and is labeled 'node', and it points to the second node, which contains 99 and is labeled 'node.next'. The arrow connecting them is labeled '3'. Key Values: Node 1: 12, Node 2: 99 Context: This diagram represents the linked list after the deletion operation is complete, showing the resulting structure. This matches the output of the Python code.