## Data Structures and Other Objects Using JavaThis text uses a five-step method for working with data types, to ensure students have a thorough knowledge of the subject and understand the data type abstractly. It also aims to teach students how to use the data type, design and implement it, and analyze the implementation. |

### From inside the book

Results 1-3 of 87

Page xvii

5.3 Nodes of Objects 264 Nodes That Contain Object Data 264 Pitfall: Misuse of

the equals Method 265 Other Collections That Use Linked Lists 267

5.3 Nodes of Objects 264 Nodes That Contain Object Data 264 Pitfall: Misuse of

the equals Method 265 Other Collections That Use Linked Lists 267

**Self**-**Test****Exercises**for Section 5.3 267 5.4 Interfaces and the API (Optional Section) 267 ...Page xviii

6.3 Implementations of the Stack ADT 319 Array Implementation of a Stack 319

Linked List Implementation of a Stack 325 Disucssion of the Linked List

Implementation of the Stack 325

Complex ...

6.3 Implementations of the Stack ADT 319 Array Implementation of a Stack 319

Linked List Implementation of a Stack 325 Disucssion of the Linked List

Implementation of the Stack 325

**Self**-**Test Exercises**for Section 6.3 328 6.4 MoreComplex ...

Page xix

... Maze — Implementation 413 The Recursive Pattern of Exhaustive Search with

Backtracking 415 Programming Example: The Teddy Bear Game 418

Ensure ...

... Maze — Implementation 413 The Recursive Pattern of Exhaustive Search with

Backtracking 415 Programming Example: The Teddy Bear Game 418

**Self**-**Test****Exercises**for Section 8.2 418 8.3 Reasoning about Recursion 420 How toEnsure ...

### What people are saying - Write a review

User Review - Flag as inappropriate

trtgfhh

### Contents

Chapter | 2 |

LEARNING OBJECTIVES | 14 |

Chapter Summary and Solutions | 38 |

Copyright | |

25 other sections not shown

### Other editions - View all

### Common terms and phrases

Accessor method activated addAll algorithm applet arithmetic overflow array B-tree binary search tree binary tree BTNode Celsius clone method collection class computation constructor contains copy create current element cursor data type digits double numbers empty example expression extended class Figure graph hash table head reference heap heapsort Indicates insufficient memory information hiding initial capacity input IntArrayBag integer IntNode iterator Java Javadoc linked list Location loop manyItems mergesort method returns node null reference number of elements number of operations package parameter position Postcondition pre-order traversal Precondition priority queue private instance variables pseudocode public boolean public class public int public Object public static void public void quicksort recursive call reference variable remove return value returns true root Self-Test Exercises sequence shown simulation specified stack statement step stored string subtree Suppose target Throttle Throws TreeMap vertex vertices write zero