Notes

Data Structures

Dijkstra's Algorithm

An algorithm for finding the shortest paths between nodes in a graph.

By Siping Meng

Minimum Spanning Tree

Trees that contain every nodes in a graph and has the minimum weight.

By Jenny Chen

Disjoint Sets

An efficient way to store and query information about set membership.

By Eddie Huang

Heaps

Tree structures that allow you to quickly both store elements and query the most important element

By Eddie Huang

Hash Table

Structure that can map keys to values

By Siping Meng

k-d Trees

Trees for points in k dimension.

By Jenny Chen

Binary Search Trees

A two-child tree that can be searched by moving left or right.

By Tamara Nelson-Fromm

B-Trees

Self-balancing trees that are characterized by their usually large branching factor. B-trees are often used for systems that read and write large blocks of data.

By Adrian Clark

AVL Trees

Self-balancing binary search trees that allow you to store and query data in logarithmic time.

By Eddie Huang

Trees

A structure for the hierarchical modeling of data.

By Eddie Huang

Queues and Stacks

Structures for storing and querying elements in particular linear orders.

By Jenny Chen, Eddie Huang

Linked Lists

A memory structure that gives a linear order to the dataset.

By Eddie Huang

C++

Iterators

An abstraction that makes it easy to traverse arbitrary data structures.

By Nathan Walters

Inheritance

A core principle of object-oriented design that allows new objects to take on properties of existing objects.

By Nathan Walters

Templates

C++ data structures that are defined over generic types

By Eddie Huang

Classes

Data structures that define the behavior of objects

By Eddie Huang