Home Modern › Forums › ISRO › A strictly binary tree with 10 leaves A strictly binary tree with 10 leaves
(A) cannot have more than 19 nodes
(B) has exactly 19 nodes
(C) has exactly 17 nodes
(D) has exactly 20 nodes
(A) cannot have more than 19 nodes
(B) has exactly 19 nodes
(C) has exactly 17 nodes
(D) has exactly 20 nodes
nan