Trees are connected hierarchical sets of nodes where any node can point to multiple nodes, and there exists no cycles in the graph representing the tree. One of the nodes is designated the root node, such that it has no parent in its tree.
Binary trees are a type of tree where no node has more than 2 children nodes. Sorted, balanced trees feature a combination of fairly efficient lookup times, additions, and deletions for large sets nodes.
| Language | Source | Description |
|---|---|---|
| C | file | Simple tree |