adts: stacks and queues part 2: using lists

fallback-no-image-3172
adts: stacks and queues part 2: using lists

in the last tutorial, we saw that arrays could get a bit tricky to use, especially with queues. if you ran the resulting program, you also saw that the output was 'a'-'j' instead of 'a'-'t' as you would expect. this was because arrays don't grow dynamically in c++. to overcome these limitations, we will now change the implementation of stack and queue to use linked lists instead of arrays to store the data. again, i will use strings for the data, but it can be easily converted to use templates.

Website Link Visit Link Here
Category
Author: CodeCall Programming Forum
Comments

ToolBox
  • January 2, 2009 12:34 pm
  • Related Tutorials

    Subscribe to get this amazing EBOOK FREE

    By subscribing to this newsletter you agree to our Privacy Policy

    Skip to content