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

### From inside the book

Results 1-3 of 22

Page 369

FIGURE 12.7 A complete tree Inorder Traversal Given the tree shown in Figure

12.7, an inorder traversal would produce the sequence D, B, E, A, C. As defined

earlier, inorder traversal is accomplished by visiting the

...

FIGURE 12.7 A complete tree Inorder Traversal Given the tree shown in Figure

12.7, an inorder traversal would produce the sequence D, B, E, A, C. As defined

earlier, inorder traversal is accomplished by visiting the

**left child**of the node, then...

Page 412

However, this time the larger path length is in the right subtree of the right child of

the root. To get this tree into balance, we need to > Make the right child element

of the root the new root element. > Make the former root element the

However, this time the larger path length is in the right subtree of the right child of

the root. To get this tree into balance, we need to > Make the right child element

of the root the new root element. > Make the former root element the

**left child**...Page 417

Leftright Rotation in an AVL Tree If the balance factor of a node is -2, this means

that the node's left subtree has a path that is too long. We then check the balance

factor of the

Leftright Rotation in an AVL Tree If the balance factor of a node is -2, this means

that the node's left subtree has a path that is too long. We then check the balance

factor of the

**left child**of the original node. If the balance factor of the**left child**is ...### 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