Data Structures in Practice

Yonas Alemu · 388 pages

Lists, stacks, queues, trees, hash tables and graphs, implemented in Java with careful complexity analysis.

27%

Key concepts

Algorithmic Complexity

Describing how running time and memory grow with input size.

Also in 2 other resources

Trees & Graphs

Hierarchical and networked structures for representing relationships.

Also in 1 other resource

Recursion

Solving a problem by reducing it to smaller instances of itself.

Also in 1 other resource

Classes & Objects

Classes describe a blueprint; objects are the living instances created from it.

Also in 5 other resources