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

### From inside the book

Results 1-3 of 18

Page xxiii

16.2 2-3 TREES 498 Inserting Elements into a 2-3 Tree 499 Removing Elements

from a 2-3 Tree 501 16.3 2-4 TREES 505 16.4

FOR

16.2 2-3 TREES 498 Inserting Elements into a 2-3 Tree 499 Removing Elements

from a 2-3 Tree 501 16.3 2-4 TREES 505 16.4

**B**-**TREES**506 16.5 MOTIVATIONFOR

**B**-**TREES**507 B* -trees 507 B+-trees 508 Analysis of**B**-**trees**508 16.6 ...Page 509

search a single path from the root to a leaf in the tree and, at worst, the length of

that path would be log2n. Analysis of

...

search a single path from the root to a leaf in the tree and, at worst, the length of

that path would be log2n. Analysis of

**B**-**trees**is similar. At worst, searching a**B**-**tree**, we will have to search a single path from the root to a leaf and, at worst, that...

Page 511

If the propagation effect of a 2-3 tree insertion causes the root to split, the tree

increases in height. > A 2-4 tree expands on the concept a 2-3 tree to include the

use of 4-nodes. > A

...

If the propagation effect of a 2-3 tree insertion causes the root to split, the tree

increases in height. > A 2-4 tree expands on the concept a 2-3 tree to include the

use of 4-nodes. > A

**B**-**tree**extends the concept of 2-3 and 2-4 trees so that nodes...

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