Treffer: Object-Oriented Data-Structures.

In this chapter, we describe the two most fundamental data-structures usually encountered in applications: stacks and queues. We begin by explaining the queue data-structures and their generalization to priority queues. We then describe stacks. Furthermore, we introduce the notion of abstract datastructures defined by their prototype interfaces, and show how to program these abstract data-structures using the object-oriented functionalities of Java. We revisit some of the static functions handling data-structures covered in the previous chapters into the OO paradigm by designing class methods that act on objects themselves. [ABSTRACT FROM AUTHOR]

Copyright of Concise & Practical Introduction to Programming Algorithms in Java is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)