A binary tree with 2k vertices of level k has at least _______ vertice

1.	A binary tree with 2k vertices of level k has at least _______ vertices.
A.	2 power k
B.	2 power (k-1)
C.	2 power (k-1)-1)
D.	2 power (k+1)-1
Answer» E.

Discussion