2. Trees

A 'tree' is a basic data structure in computing. It links a number of data elements together in a hierarchy, from top to bottom. A general tree structure is shown below

Each element in the tree is called a 'node' and each link is called a 'branch'. The node at the top of the tree is called the 'root node' and each node below it is called a 'leaf node'.

Alternatively, instead of roots and leaves, you may also hear nodes described as 'parent' nodes and 'child' nodes.

Just like a family tree, the parents are placed at a higher level, above the children. In the example above, if we look at 'Item B', then its 'parent' node is 'Item A' and its 'child' nodes are Items E, D and C.

Why does this matter? Well, in computing terms, each node records the memory locations of all of the nodes to which it is connected, i.e. the parent and child nodes.

The way that trees are organised allows for very efficient sorting, searching and managing of data.