Multiple choices 33/50
(Choose 1 answer)
A. Insert a new node at the tail of the list
B. Remove the last node
C. Traverse the list
Next
D. Insert a new node at the beginning of the list
What does the following code do?
def Operation(self, newdata):
NewNode = Node(newdata)
if self.head is None:
self.head = NewNode return
laste = self.head
while(laste.next):
laste = laste.next
laste.next=NewNode
1
2
3
4
5
6
7
8
9
10
11
12 13
14
15
16
17
18
19
20
21
22 23 24
25 26 27
28
29
30
31
32
33
34
35
36
37
38
39
40 41
42
43
44
45 46 47 48
49 50
