A Practical Guide to Data Structures and Algorithms using Java

Index 1015

self-adjusting 351

soft, 351

treap, 352

Heap node inner class, 402–405

Heap-ordered tree, 373, 399, 424

Heap sort, 141, 147–149, 235–236

Height

of search trees, 75, 449, 451, 504, 570

of skip list, 594

of trie, 664

Hierarchical-cutting tree, 733

Historical event collection, 8–10, 443–444, 826–828

Hoare partition algorithm, 151–154, 238

Huffman coding, 343–345

I

Identity function, 281, 291

Image segmentation, 919–920

Immutable, 280, 785, 787, 803, 848, 963

import, 961

In-place algorithm, 140

in-place depth-first search, 879–880

In-tree, 13, 75, 861–865

Incident, 845

edge iterator inner class, 893–896

Indegree, 847

IndexedNumber, 54–55

Indexing trie, 623, 628, 631–633

Inedges, 847, 852–854, 905, 908–910

Inherit, 960

Inner class, 969–970

Inorder traversal, 71,