Before you keep reading...

Runestone Academy can only continue if we get support from individuals like you. As a student you are well aware of the high cost of textbooks. Our mission is to provide great books to you for free, but we ask that you consider a $10 donation, more if you can or less if $10 is a burden.

Support Runestone Academy Today

Before you keep reading...

Making great stuff takes time and $$. If you appreciate the book you are reading now and want to keep quality materials free for other students please consider a donation to Runestone Academy. We ask that you consider a $10 donation, but if you can give more thats great, if $10 is too much for your budget we would be happy with whatever you can afford as a show of support.

Support Runestone Academy Today

3. Linear Structures

Linear Structures

• 3.1. Objectives
• 3.2. What Are Linear Structures?
• 3.3. What is a Stack?
• 3.4. The Stack Abstract Data Type
• 3.5. Using a Stack in C++
• 3.6. Simple Balanced Parentheses
• 3.7. Balanced Symbols - A General Case
• 3.8. Converting Decimal Numbers to Binary Numbers
• 3.9. Infix, Prefix and Postfix Expressions
  • 3.9.1. Conversion of Infix Expressions to Prefix and Postfix
  • 3.9.2. General Infix-to-Postfix Conversion
  • 3.9.3. Postfix Evaluation
• 3.10. What Is a Queue?
• 3.11. The Queue Abstract Data Type
• 3.12. Using a Queue in C++
• 3.13. Simulation: Hot Potato
• 3.14. Simulation: Printing Tasks
  • 3.14.1. Main Simulation Steps
  • 3.14.2. C++ Implementation
  • 3.14.3. Discussion
• 3.15. What Is a Deque?
• 3.16. The Deque Abstract Data Type
• 3.17. Using a Deque in C++
• 3.18. Palindrome-Checker
• 3.19. Summary
• 3.20. Discussion Questions
• 3.21. Programming Exercises
• 3.22. Glossary
• 3.23. Matching

You have attempted of activities on this page