G5BADS Informal coursework 3
For tutorials in the week of the 1st-5th December:
Prove by mathematical induction that a perfectly balanced binary tree with k levels contains 2
k-1
leaves.
Calculate how many levels a complete binary tree of size x has.