Skip to main content

CS201: Elementary Data Structures

Page path
  • Home /
  • Courses /
  • Course Catalog /
  • Computer Science /
  • CS201: Elementary Data Structures /
  • Unit 5: Linked Stacks, Queues, and Lists /
  • 5.3: Linked Queues
Back to 'Unit 5: Linked Stacks, Queues, and Lists'
  • 5.3: Linked Queues

    •  Virginia Tech: Clifford Shaffer's "Data Structures and Algorithm Analysis: Linked Queues" File

      Read Sections 4.3.2 and 4.3.3 on this page. The discussion is short, since queues are not much different from stacks. While the difference is subtle, it is important in many applications.

    • Steven Ford's "q Module" Page

      This is another approach to linked queues. As with linked lists and linked stacks, don't get too attached to any one implementation.

Navigation

Art History
Biology
Business Administration
Chemistry
Communication
Economics
English
History
Mathematics

Creative Commons License
© Saylor Academy 2010-2018 except as otherwise noted. Excluding course final exams, content authored by Saylor Academy is available under a Creative Commons Attribution 3.0 Unported license. Third-party materials are the copyright of their respective owners and shared under various licenses. See www.saylor.org/open/licensinginformation for detailed licensing information.

Saylor Academy and Saylor.org® are trade names of the Constitution Foundation, a 501(c)(3) organization through which our educational activities are conducted.

Terms of Use | Privacy Policy