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

Page 144

start, getCurrent, advance so that it returns the next element of the

example, if a

and 42, then we can write the following code to print the first three numbers of the

...

start, getCurrent, advance so that it returns the next element of the

**sequence**. Forexample, if a

**sequence**called numbers contains the four numbers 37, 10, 83,and 42, then we can write the following code to print the first three numbers of the

...

Page 145

The current element can be removed from a

has no parameters, but the precondition requires that there is a current element; it

is this current element that is removed, as specified here: ♢ removeCurrent ...

The current element can be removed from a

**sequence**. The method for a removalhas no parameters, but the precondition requires that there is a current element; it

is this current element that is removed, as specified here: ♢ removeCurrent ...

Page 149

(FIGURE 3. 10 continued) ♢ addAfter and addBefore public void addAfter (double

element) public void addBefore(double element) Adds a new element to this

take ...

(FIGURE 3. 10 continued) ♢ addAfter and addBefore public void addAfter (double

element) public void addBefore(double element) Adds a new element to this

**sequence**, either before or after the current element. If this new element wouldtake ...

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