Redirected
recategorized by
1,453 views

1 Answer

2 votes
2 votes

If binary tree  external nodes=n, then internal nodes =(n-1)

Path length from root to leaf will be O(log n)

As there are n external nodes, so n such path exists

So, total length of external path = n log n

Ans 2)

Related questions

1 votes
1 votes
0 answers
1
Akriti sood asked Mar 24, 2017
1,835 views
can someone pls explain how is the internal path length of complete binary tree is O(n logn)? (if it is correct)
0 votes
0 votes
1 answer
2
monali asked Jan 11, 2016
765 views
2 votes
2 votes
1 answer
4
vijaycs asked May 25, 2016
12,709 views