Resolve "Give T(n) and determine big-Oh: Tree algorithms"

Adds three exercises where students analyse the complexity of an algorithm:

• Determining the height of a tree
• Summing the values of all nodes in a balanced tree
• Heap sort

Closes #88 (closed)