If the out degree of every node is exactly equal to M or 0 and the num ber of nodes at level K is Mk-1 [con sider root at level 1], then tree is called as

(i) Full m-ary try
(ii) Com plete m-ary tree
(iii)Positional m-ary tree
A. Only (i)
B. Only (ii)
C. Both (i) and (ii)
D. Both (ii) and (III)

Ans: C