0 votes
69 views
in Programming Languages & Algorithms by (user.guest)

1 Answer

0 votes
by (user.guest)
 
Best answer

In a binary tree if there are N leaf nodes then the number of nodes having 2 children will be N-1.

So, the number of nodes in T having two children  = 20 − 1 = 19.


Related questions

+1 vote
1 answer 2.7k views
+1 vote
1 answer 2.1k views
+1 vote
1 answer 171 views
0 votes
0 answers 279 views
+2 votes
1 answer 275 views
Welcome to CPENTalk.com
Solution-oriented students of computer engineering on one platform to get you that

ONE SOLUTION

...