## 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 73

Page 143

We could have had a different underlying

collection that can simultaneously handle many different types of

...

We could have had a different underlying

**element**type such as a bag of double**numbers**or a bag of characters. In fact, in Chapter 5, we'll see how to construct acollection that can simultaneously handle many different types of

**elements**rather...

Page 152

(FIGURE 3.10 continued) ♢ size public int size( ) Accessor method to determine

the

sequence ♢ start public void start( ) Set the current element at the front of this ...

(FIGURE 3.10 continued) ♢ size public int size( ) Accessor method to determine

the

**number of elements**in this sequence. Returns: the**number of elements**in thissequence ♢ start public void start( ) Set the current element at the front of this ...

Page 539

Removing an element from a binary search tree, a heap, or a B-tree. 3. Searching

for a specified ... Once this question is answered, we can provide worst-case time

analyses in terms of the

Removing an element from a binary search tree, a heap, or a B-tree. 3. Searching

for a specified ... Once this question is answered, we can provide worst-case time

analyses in terms of the

**number of elements**in a tree. Time Analysis for Binary ...### 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