Tag:algorithm

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

Binary Search Tree is a node-based binary tree data structure, smaller node in the left and larger node in the right

Priority Queue is an abstract data type that is similar to a queue, and every element has some priority value associated with it.

Non terrae plus ultra!

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.

Sorting plays a major role in commercial data processing and in modern scientific computing

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.