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

Page 437

The root is an ancestor of each other node. Descendant. A node's children are its

first descendants. The children's children are its next descendants. The children

of the children of the children are . . . well, you get the idea.

...

The root is an ancestor of each other node. Descendant. A node's children are its

first descendants. The children's children are its next descendants. The children

of the children of the children are . . . well, you get the idea.

**Subtree**. Any node in...

Page 450

In this case, we want to remove the leftmost node from the left

example, suppose the root of this tree activates removeLeftmost: "Howkeye"

Spiderman" "Submariner" "Superman" "Storm" "Thing" "Wolverine" We must

remove the ...

In this case, we want to remove the leftmost node from the left

**subtree**. Forexample, suppose the root of this tree activates removeLeftmost: "Howkeye"

Spiderman" "Submariner" "Superman" "Storm" "Thing" "Wolverine" We must

remove the ...

Page 490

The cursor could be non-null and it does have a left child, so we can't simply

ignore the left

whether there is a right child, and if not, we could have a plan that ignores the

right ...

The cursor could be non-null and it does have a left child, so we can't simply

ignore the left

**subtree**of the cursor (as we did in cases 2 and 3). We could checkwhether there is a right child, and if not, we could have a plan that ignores the

right ...

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