00:05
Is greater than equal t is a full by thesis.
00:50
For the base step, t consists only of the root.
01:07
So in this case, we have the extreme of t is going to be equal to.
01:16
The height of t is going to be zero.
01:23
So it follows that, which is one is greater than or equal to 2, 2 times 0 plus 1, which is equal to each of t.
01:45
So we prove the statement correct for the base case.
01:51
For the recursive step, we have it, number of nodes in this tree, t2, with t2, there is t1 times.
02:53
We call it the way t1 times t2 is constructed.
03:03
You take two trees and join them adding another vertex.
03:09
So we take their roots and then we draw vertices to the new route...
