A study and analysis of data structures in Java written with the intention of helping myself, and anyone else, understand data structures and algorithms during University Comp-Sci or Software Engineering degree.

Data structures are crazy important; they can (and have) improve (and detriment) quality of life and even save (or destroy) lives on the regs. They exist everywhere and, increasingly, we interact with them more than we interact with each other. Heck, we even use them to interact with each other.

There's some pretty heavy stuff being covered in this wiki so to make things a bit easier to follow we've (the royal we) organised a section of introductory information as a precursor to the analysis pages. If you already understand words like;

• mathematical terms such as;
• exponentials
• logarithms
• factorials
• asymptotic notation
• probability
• randomisation
• Computational model
• Correctness, running time and space.

Then feel free to skip these sections and run right along to the analysis (analyisis?, analysises?) of the data structures.

• Why we need efficiency
• Interfaces
• Mathematical Background
• Computational Model
• Correctness, Time Complexity, and Space Complexity
• List of Data Structures

• Array-Based Lists
• Linked Lists
• Skiplists
• Hash Tables
• Binary Trees
• Random Binary Search Trees
• Scapegoat Trees
• Red Black Trees

Resources & References