tree data structure

A tree data structure is a hierarchical collection of nodes connected by edges, with a single root node and zero or more child nodes per parent, used to represent parent-child relationships and enable efficient data organization and traversal.

Aliases (1)

• hash tree ×1

Instances (2)

• B-tree
• Merkle ("hash tree")