Dynamic Linked Lists
•Wisely controlled dynamic memory can save considerable memory that may be wasted by other implementations
•We are not limited to fixed size restrictions
•Certain operations are simpler with linked structures (inserting into a linked list consists of only 2 assignment statements, once we have found the location)...no shifting!