Question: OUT CON Write the answer to each of the five questions (5 points each). #Questions top = None top = makeNode (6 , top) top

OUT CON Write the answer to each of the five questions (5 points each). #Questions top = None top = makeNode (6 , top) top = makeNode (10 , top top = makeNode-3, top top = makeNode (2 , top) print (toString (top)) #Part A: What does the previous line print out? O 12 len = length (top) 13 print("Length of list: %d" %(len)) #Part B: What is the value of len? 14 18 insert Tail (25, top) print (toString (top)) #Part C: What does the previous line print out? ten = find (10, top) if ten=None: print("Not Found: 10") else: print("Found: 10, Memory ID: %d" %(id (ten))) top = delete (ten, top) print (toString (top)) #Part D: What does the previous line print out? two = find (2, top) top = delete (two, top) print (toString (top)) #Part E: What does the previous line print out? 43 fifteen = find (15, top) top = delete (fifteen, top) print (toString (top)) #Part F: What does the previous line print out? OUT CON Write the answer to each of the five questions (5 points each). #Questions top = None top = makeNode (6 , top) top = makeNode (10 , top top = makeNode-3, top top = makeNode (2 , top) print (toString (top)) #Part A: What does the previous line print out? O 12 len = length (top) 13 print("Length of list: %d" %(len)) #Part B: What is the value of len? 14 18 insert Tail (25, top) print (toString (top)) #Part C: What does the previous line print out? ten = find (10, top) if ten=None: print("Not Found: 10") else: print("Found: 10, Memory ID: %d" %(id (ten))) top = delete (ten, top) print (toString (top)) #Part D: What does the previous line print out? two = find (2, top) top = delete (two, top) print (toString (top)) #Part E: What does the previous line print out? 43 fifteen = find (15, top) top = delete (fifteen, top) print (toString (top)) #Part F: What does the previous line print out
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
