## Java Software Structures: Designing and Using Data StructuresThe second edition of |

### From inside the book

Results 1-3 of 15

Page 377

... we would create various implementations, such as an emptyTreeNode, an

innerTreeNode, and a leaf TreeNode, that would distinguish the various

possibilities. The removeLeft

binary tree, we ...

... we would create various implementations, such as an emptyTreeNode, an

innerTreeNode, and a leaf TreeNode, that would distinguish the various

possibilities. The removeLeft

**Subtree**Method To remove the left**subtree**of abinary tree, we ...

Page 414

IMPLEMENTING BINARY SEARCH TREES: AVL TREES Key Concept The

height of the right

Concept There are only two ways that a tree, or any

become ...

IMPLEMENTING BINARY SEARCH TREES: AVL TREES Key Concept The

height of the right

**subtree**minus the height of the left**subtree**is called KeyConcept There are only two ways that a tree, or any

**subtree**of a tree, canbecome ...

Page 498

A 2-node contains one element and, like a binary search tree, the left

contains elements that are less than that element and the right

elements that are greater than or equal to that element. However, unlike a binary

...

A 2-node contains one element and, like a binary search tree, the left

**subtree**contains elements that are less than that element and the right

**subtree**containselements that are greater than or equal to that element. However, unlike a binary

...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Software Development | 2 |

ObjectOriented Design | 30 |

Collections | 83 |

Copyright | |

17 other sections not shown

### Other editions - View all

Java Software Structures: Designing & Using Data Structures John Lewis,Joseph Chase No preview available - 2005 |

### Common terms and phrases

abstract add add add addElement ancestor tree array implementation ArrayList AVL tree B-tree binary search tree binary tree boolean button called Card Chapter complexity constructor contains count create data structure deckSet defined dequeue disks doubly linked list element stored empty enqueue example expression tree Figure hash table hashing function heap ImageIcon insertion insertion sort integer interface isEmpty iterator Java Collections API jss2 Key Concept left child Lewis/Chase linear linked implementation linked list loop merge sort method node null number of elements operation ordered list parameter parent path position postfix expression problem provides public class public void queue radix sort rear recursive reference variable remove represent return result Returns true right child root Self-Review Questions set collection sort algorithm stack static String subtree System.out.println target element temp tion toString traversal UML description undirected graph unordered list vertex vertices waterfall model web crawler