G5BADS 2004-5 informal coursework 2
For tutorials in the week of the 1st-5th November:
Prove by mathematical induction that a proper binary tree with
k levels contains 2k-1 leaves. Do the proof from scratch without using
other claims proved the lecture.