Today, we begin to look at sorting algorithms. They are important because sorting is often used to simplify and optimize other algorithms.
The choice of the right sorting algorithm depends on
Trees A tree is made up of nodes (data elements) with zero, one or several references to other nodes. Each node has only one other node referencing it.
The height of a tree is defined to be the maximum distance from the root node to any leaf node. Write a function to calculate the height of an arbitrary tree.