Linked Lists: questions with answers

1
2
3
4
5
6
7
8
9
10

class Node:
    def __init__(self, val, next=None):
        self.val = val
        self.next = next

head = Node(4, Node(8, Node(15)))
cur = head
while cur:
    print(cur.val, end=' ')
    cur = cur.next

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

class Node:
    def __init__(self, val, next=None):
        self.val = val
        self.next = next

def build(vals):
    head = None
    for v in reversed(vals):
        head = Node(v, head)
    return head

def show(head):
    out = []
    while head:
        out.append(head.val)
        head = head.next
    print(*out)

prev, cur = None, build([1, 2, 3, 4])
while cur:
    nxt = cur.next
    ____________
    prev, cur = cur, nxt
show(prev)