Computer Science, asked by dhalsmita45, 7 months ago

a complete n-Ary there is one in which every node has o or not sons if 7 is the number of leaves in it is given by (i) - 15.(ii)20.(iii)22 (iv) 14.​

Answers

Answered by 107859504699232
0

Answer:

not a

Explanation:

e7euegy#ud8jeh|u₹

Similar questions