Tag:tree

A B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, insertions, and deletions in logarithmic time.

A Red-Black Tree is a tree that's always trying to keep its cool, but never quite succeeds (since it's constantly balancing itself).

A Graph data structure consists of a set of vertices (or nodes) and a set of edges that connect these vertices.

Minimum spanning tree is a subset of the edges of a connected, undirected graph that connects all the vertices together, without any cycles and with the minimum total edge weight.