0 votes 0 votes how to do these kinds of problems? Algorithms made-easy-test-series + – Abhinav Gupta asked Aug 15, 2018 retagged Jul 12, 2022 by makhdoom ghaya Abhinav Gupta 433 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Shaik Masthan commented Aug 15, 2018 reply Follow Share @arvin, i know that proof.... i asked to you for the questioner not for me.... i asked to you only because you used that formula 0 votes 0 votes Rishav Kumar Singh commented Aug 15, 2018 reply Follow Share Abhinav Gupta can you please close this question, You can visit above link. 0 votes 0 votes arvin commented Aug 15, 2018 reply Follow Share ok ok bro :) fine no worries :) 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Internal Nodes (I) = $40$ Leaf Nodes(L) =$401$ Then find type of tree(n - ary tree find n) : Relation btw I and L in terms of n $ L = I(n-1)+1 $ and Relation btw Leaf , Internal and Total(N) nodes $ I + L = N $ $L = \frac{(2N-1)}{3}$ arya_stark answered Aug 16, 2018 arya_stark comment Share Follow See all 0 reply Please log in or register to add a comment.