- Forward


Linked Queues
With Examples in C++


Prof. David Bernstein
James Madison University

Computer Science Department
bernstdh@jmu.edu

Print

Motivation
Back SMYC Forward
  • So far, our implementations of queues have been limited to a pre-specified number of elements
  • Dynamic memory allocation makes it possible for us to develop much more flexible implementations
  • We could use dynamic memory allocation with contiguous implementations or linked implementations
  • We'll discuss a linked implementation here
From Our Linked Stack
Back SMYC Forward
cppexamples/linkedstack/templated/Node.h
 
A Linked Queue
Back SMYC Forward
cppexamples/linkedqueue/Queue.h
 
cppexamples/linkedqueue/Queue.cpp
 
There's Always More to Learn
Back -