My Extensive Examination of Data Structures article series was originally slated for six installments, five of which have been published at this time. (The sixth part is on sets and efficiently maintaining disjoint sets; it's been written and is going through the editing process at MSDN.) Throughout the run of the article series I have received a lot of great questions and feedback from readers. A recurring request from readers was to have an installment on linked lists. While I did discuss linked lists briefly in Part 4, they do warrant an entire installment as opposed to just a few paragraphs. Fortunately, my MSDN editor (Duncan Mackenzie) has given me the go ahead for a seventh installment on linked lists!
I expect the article will go something like:
- Overview of linked lists.
- Historical Context
- Comparison to trees and graphs
- Flavors or linked lists
- Vanilla linked lists
- Linked lists with forward/previous references
- Circular linked lists
- Other linked list structures
- Real-world examples of linked lists
If you have any suggestions for additional content areas to be covered or expounded upon, I'm all ears.