Linked List ni traversal qilish

Traversal — Linked List ning barcha elementlarini ketma-ket ko'rib chiqish.

Traversal har doim bir xil ko'rinishda yoziladi:

current = head
while current:
    # ... amal bajarish
    current = current.next

Elementlar sonini hisoblash:

node1 = Node(10)
node2 = Node(20)
node3 = Node(30)
node1.next = node2
node2.next = node3
head = node1

son = 0
current = head
while current:
    son += 1
    current = current.next
print(son)  # 3

Yig'indini hisoblash:

yigindi = 0
current = head
while current:
    yigindi += current.data
    current = current.next
print(yigindi)  # 60

Elementni qidirish:

izlangan = 20
current = head
topildi = False
while current:
    if current.data == izlangan:
        topildi = True
        break
    current = current.next

print(topildi)  # True

Muhim qoidalar:

• current = head — boshidan boshlash
• while current: — None bo'lguncha davom etish
• current = current.next — keyingi nodega o'tish
• Traversal'ning murakkabligi O(n) — chunki har elementni bir marta ko'radi

📝 Vazifa

Linked List elementlari yig'indisi

Sonlarni kiritib, linked list yarating. Traversal yordamida yig'indini hisoblang va chiqaring.