Skip to page content
Stacks and Queues
Computer Science · Chapter 11 · Section C: Inheritance, Interfaces, Polymorphism, Data Structures and Complexity
Not started Not started
Your path through this chapter
Visual lesson Coming soon
Short slides, one idea at a time. We are preparing this chapter's lesson.
Notes Coming soon
Clear chapter notes for quick revision.
Flashcards Coming soon
Quick recall of key terms and facts.
Practice Coming soon
Board-style questions with instant checks.
Chapter test Free
Short and long chapter tests in board pattern, with results and analysis.
Step 5: Not started
Topics 5
- Data structures as abstract data types; definition through an interface with multiple implementations
- Stack: push, pop, peek, overflow and underflow; array implementation
- Queue and circular queue: insertion, deletion, front and rear
- Double-ended queue (dequeue)
- Infix, prefix and postfix notation; conversion of infix to prefix and postfix