Chapter 24.4, Problem 24.4.5CP

Program Plan Intro

Linked list:

• In the linked list, each node in the list points to the next node.
• Linked list contains two fields named “data” and “next”.
  • The “data” field contains the data (string or numbers).
  • The “next” field contains the address of the next node.
• Linked list can grow and shrink in its size; it does not have a fixed size.
• To remove an item from the linked list, the pointer pointing to the item in list is changed to next item.

Array list:

• Array list are being implemented using an array.
• An array is a data structure that is of fixed size.
• Array once created its size cannot be changed.