Math, asked by sp784413, 2 months ago

the total number of vertices in a binary tree is n, then prove that the number of internal vertices in it is (n-1) /2

Answers

Answered by sufiyamodi01

0

Answer:

1jeghsbejhsvwiwbhehevdhhd

Previous Question

Next Question

Similar questions

English, 1 month ago

The customers (wonder) why the shop____not ____(open) yet. Change into past ...

English, 1 month ago

fill this word bo_l_d...

Chemistry, 1 month ago

A weak acid is highly corrosive and can cause burns. (True or False).

English, 2 months ago

pls bta do paper chal rha hai jo correct answer dega usko 400 likes or jo wrong usko 400 report..

Social Sciences, 2 months ago

THE CONSTITUTION HAS SET A LIMIT OF MAXIMUM NUMBER OF MLAs AS...

Math, 8 months ago

Find mean by using deviation method Daily wages 200-250 250-300 300-350 350-400 400-450 No of workers 6 8 14 10 12...

History, 8 months ago

define the following 1) ostracize...

Math, 8 months ago

find the missing no 1, 2, 8, 33, 148, ___, 4626 A)665 B)765 C)760...