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.nextElementlar 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) # 3Yig'indini hisoblash:
yigindi = 0
current = head
while current:
yigindi += current.data
current = current.next
print(yigindi) # 60Elementni qidirish:
izlangan = 20
current = head
topildi = False
while current:
if current.data == izlangan:
topildi = True
break
current = current.next
print(topildi) # TrueMuhim qoidalar:
current = head — boshidan boshlashwhile current: — None bo'lguncha davom etishcurrent = current.next — keyingi nodega o'tishLinked List elementlari yig'indisi
Sonlarni kiritib, linked list yarating. Traversal yordamida yig'indini hisoblang va chiqaring.