summary in this we have looked at linked lists we have studied the concepts that underlie listssuch as nodes and pointers to other nodes we implemented the major operations that occur on these types of list and saw how their worst case running times compare in the next we are going to look at two other data structures that are usually implemented using listsstacks and queues