August 2007
Intermediate to advanced
1056 pages
41h 26m
English
book
A Practical Guide to Data Structures and Algorithms using Java
by Sally. A Goldman, Kenneth. J Goldman
Content preview from A Practical Guide to Data Structures and Algorithms using Java
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Index 1025
representation properties, 197
terminology, 196–197
tracker inner class, 207–213
wrappers for sorting, 205–207
Tracked implementation, 89
Tracked interface, 92
Tracked tagged interface, 791
Tracker, 23–24, 36, 45, 49, 65–70
between positions, 110, 196
case study, 63–65
in greedy tree builder, 928
in positional collection, 113, 115–116
inner class
B-tree, 568–570
binary search tree, 501–504
leftist heap, 391–393
pairing heap, 415–418
singly linked list, 246–251
skip list, 610–613
tracked array, 207–213
trie, 662–664
optimization for edge removal, 853
preserving, 81
Transitive, 52
Transitive closure, computing, 955
Transposable elements, 828
Treap, 352, 453, 733
Tree, 10–13, 30
abstract search tree, 471–480
B-tree, 451, 545–574
B+-tree, 451, 575–592
balanced binary ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.