Titlebook: ;

只有

congenial

Stacks Using Arrays,ch adding and removing an item, push and pop, are discussed. Using stacks, elements in the list can easily be reversed and strings can be checked for a palindrome. Further, prefix and postfix expressions are discussed where postfix expressions can be evaluated using stacks.

IOTA

CEDE

Lists Using Arrays, dequeued from the front, a list can have items inserted or deleted from the front, rear, or anywhere in between. In this chapter arrays are used to implement ordered lists. The insert and delete methods in addition to the search method are discussed. In the complete program recursion is used to print strings stored in the list.

anagen

Ordered Linked Lists,f a linked list, as well as in an empty list. The delete method is examined and is left as an exercise. Doubly linked lists as well as an inner class are introduced and the complete program implements a list of user defined objects.

BOGUS

AER

Sorting,ck sort. The third is called the radix (or bucket) sort and can be used for sorting physical items, but can also be adapted to sort items in memory as well. Al three sorts are illustrated using diagrams and include an elementary analysis of the algorithms. The complete program uses the quick sort to sort string items.

笨拙的我

Hashing,s efficiently. It introduces simple hash functions and discusses how to deal with collisions. The chapter also shows implementation of hash tables using the . class and the . class defined in Java Application Program Interface (API). A small database is created with the . class using simple GUI in the complete program.

adulterant

Guide to Data Structures978-3-319-70085-4Series ISSN 1863-7310 Series E-ISSN 2197-1781

jaunty