Can someone please check my answers.
Let t be a binary tree with 2148 vertices.
1)Is it possible that the height of T is less than 8? No, because -1 + 2 ^(7+1) = 255.
If t is a full then:
2) the number of leaves? 2047
3) the number of internal vertices? 1124
4) the height of t? 11.
Can someone check these please. Someone on the forum gave me a formula but im not sure if i used it correctly. Thanks!