A hierarchical structure with nodes, where each node has a value and links to child nodes.
A tree data structure where each node has at most two children, with the left child less than the parent and the right child greater.
A self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time.
A collection of nodes connected by edges, represented using adjacency matrices or lists.
A subgraph that connects all vertices in a graph without cycles and with the minimum possible number of edges.