Abstract
In this chapter, we will explain the following:
-
The notion of an abstract data type
-
What a stack is
-
How to implement a stack using an array
-
How to implement a stack using a linked list
-
How to create a header file for use by other programs
-
How to implement a stack for a general data type
-
How to convert an expression from infix to postfix
-
How to evaluate an arithmetic expression
-
What a queue is
-
How to implement a queue using an array
-
How to implement a queue using a linked list
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Noel Kalicharan
About this chapter
Cite this chapter
Kalicharan, N. (2014). Stacks and Queues. In: Advanced Topics in Java. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4302-6620-4_4
Download citation
DOI: https://doi.org/10.1007/978-1-4302-6620-4_4
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4302-6619-8
Online ISBN: 978-1-4302-6620-4
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)