Exercise 21, 22, 23, 24 and 25

lls adding it to the end of a list. ations, should make sure it points to e means adding it to a list, but not necessarily to the end a list means traveling through the list. 19. In a(n) n a (n) list, the last node has a pointer to the first node. -list, each node has a pointer to the one before it and the one the one after it. Algorithm Workbench 21. Consider the following code: struct ListNode int value; struct ListNode next; ListNode "head; I1 List head pointer Assume a linked list has been created and head points to the first node. Write code that traverses the list displaying the contents of each node's value member. 22. Write code that destroys the linked list described in Question 21. 23. Write code that defines an STL 11st container for holding float values. 24. Write code that stores the values 12.7,9.65, 8.72, and 4.69 in the 1ist container you defined for Question 23. 25. Write code that reverses the order of the items you stored in the 1ist container in Question 24 The programmer must know in advance how many nodes will be needed in a linked list. True or False 26. TF cecsary for each node in a linked list to have a self-referential