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

Page 25

If the largest term in a formula is no more than a constant quadratic time 0(n2)

times n2, then the

makes the ...

If the largest term in a formula is no more than a constant quadratic time 0(n2)

times n2, then the

**algorithm**is said to be "big-0 of n2," written O(n ), and the**algorithm**is called quadratic. In a quadratic**algorithm**, doubling the input sizemakes the ...

Page 332

infix expression postfix expression

Translating Infix to Postfix Notation Because it is so easy to evaluate a postfix

expression, one strategy for evaluating an ordinary infix expression is to first

convert ...

infix expression postfix expression

**algorithm**for fully parenthesized expressionsTranslating Infix to Postfix Notation Because it is so easy to evaluate a postfix

expression, one strategy for evaluating an ordinary infix expression is to first

convert ...

Page 549

An application program might retrieve a student record, bank account record,

credit record, or any other type of record using a search

we present and analyze some of the most common (and most efficient) methods

of ...

An application program might retrieve a student record, bank account record,

credit record, or any other type of record using a search

**algorithm**. In this chapter,we present and analyze some of the most common (and most efficient) methods

of ...

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