القائمة المترابطة

class Node:    def __init__(self, data):        self.data = data        self.next = None class LinkedList:    def __init__(self):        self.head = None        self.size = 0     def push_front(self, data):          # O(1)        node = Node(data)        node.next = self.head        self.head = node        self.size += 1     def append(self, data):              # O(n): نمر حتى الآخر        node = Node(data)        if self.head is None:            self.head = node        else:            cur = self.head            while cur.next is not None:                cur = cur.next            cur.next = node        self.size += 1     def find(self, data):                # O(n)        cur, i = self.head, 0        while cur is not None:            if cur.data == data:                return i            cur, i = cur.next, i + 1        return -1     def remove(self, data):              # O(n)        prev, cur = None, self.head        while cur is not None:            if cur.data == data:                if prev is None:                    self.head = cur.next     # حذف الرأس                else:                    prev.next = cur.next     # تخطي العقدة                self.size -= 1                return True            prev, cur = cur, cur.next        return False     def to_list(self):        out, cur = [], self.head        while cur is not None:            out.append(cur.data)            cur = cur.next        return out lst = LinkedList()lst.append(5)lst.push_front(3)lst.append(8)lst.remove(5)print(lst.to_list(), lst.find(8))