Computer Science - Data Structures - Linked lists - Linked List Code

P1: 'Traverse and print' → current = self.head; while ___: print(current.data); current = current.___ [current, next]. P2: 'Count nodes' → count = 0; current = self.head; while current: count += ___; current = current.next; return count [1]. P3: 'Insert at beginning' → def prepend(self, data): new_n