The data structures that we use in applications often contain a great deal of information of various types, and certain pieces of information may belong...
Of the data types that support insert and remove for collections of items, the most important is called the pushdown stack.
A stack operates somewhat like...
In this section, we consider two implementations of the stack ADT: one using arrays and one using linked lists. The implementations are both straightforward applications...
Sections through present a complete example of Java code that captures one of our most important abstractions: the pushdown stack. The interface in Section defines...
The first-in, first-out (FIFO) queue is another fundamental ADT that is similar to the pushdown stack but uses the opposite rule to decide which element...
ADTs help us manage the complexity of creating client programs that address the needs of increasingly more complicated applications by building increasingly powerful layers of...
As a final example, we consider in this section an application-specific ADT that is representative of the relationship between application domains and the algorithms and...
С 2009 года мы стали переводить структура сайта на различные языки. Сайт теперь будет содержать книги не только на английском языке, но также и на других европейских языках, в том числе и на Русском языке.