= Trees (data structures)
{wiki=Category:Trees_(data_structures)}
In computer science, a **tree** is a widely-used data structure that simulates a hierarchical organization of data. It consists of nodes connected by edges and has the following key characteristics: 1. **Roots and Nodes**: - The topmost node is called the *root*. - Each node can have zero or more child nodes (subsequent nodes branching from it). - A node that does not have any children is termed a *leaf* node.
Back to article page