المشروع الختامي

class Node:    def __init__(self, data):        self.data = data        self.next = None class LinkedList:    """قائمة مترابطة: رأس وذيل وحجم"""    def __init__(self):        self.head = self.tail = None        self.size = 0     def push_front(self, x):          # O(1)        n = Node(x)        n.next = self.head        self.head = n        if self.tail is None:            self.tail = n        self.size += 1     def push_back(self, x):           # O(1) بفضل الذيل        n = Node(x)        if self.tail is None:            self.head = self.tail = n        else:            self.tail.next = n            self.tail = n        self.size += 1     def pop_front(self):              # O(1)        if self.head is None:            raise IndexError("القائمة فارغة")        x = self.head.data        self.head = self.head.next        if self.head is None:            self.tail = None        self.size -= 1        return x     def find(self, x):                # O(n)        cur, i = self.head, 0        while cur:            if cur.data == x:                return i            cur, i = cur.next, i + 1        return -1     def __len__(self):        return self.size     def __iter__(self):        cur = self.head        while cur:            yield cur.data            cur = cur.next # اختباراتL = LinkedList()assert len(L) == 0 and L.find(5) == -1L.push_back(2); L.push_back(3); L.push_front(1)assert list(L) == [1, 2, 3] and len(L) == 3assert L.find(3) == 2assert L.pop_front() == 1 and list(L) == [2, 3]L.pop_front(); L.pop_front()assert L.head is None and L.tail is Noneprint("نجحت كل الاختبارات")

import timefrom collections import deque class Node:    __slots__ = ("data", "next")    def __init__(self, d): self.data, self.next = d, None class LinkedList:    def __init__(self): self.head = None    def push_front(self, x):        n = Node(x); n.next = self.head; self.head = n def bench(n):    t = time.perf_counter(); a = []    for i in range(n): a.insert(0, i)    t_list = time.perf_counter() - t     t = time.perf_counter(); L = LinkedList()    for i in range(n): L.push_front(i)    t_ll = time.perf_counter() - t     t = time.perf_counter(); d = deque()    for i in range(n): d.appendleft(i)    t_dq = time.perf_counter() - t    return t_list, t_ll, t_dq for n in [10_000, 40_000]:    a, b, c = bench(n)    print(f"n={n:>6} | list.insert(0): {a*1000:7.1f} ms | LinkedList: {b*1000:6.1f} ms | deque: {c*1000:5.1f} ms")