Trees are very useful and important abstractions in Computer Science.
They are ideally suited to representing hierarchical relationships
among elements in a universe. Efficient implementations of abstract
data types such as dictionaries and priority queues are invariably
in terms of binary or general trees.