Consider a complete binary tree with an odd number of nodes. Let n be the number of internal nodes (non-leaves) in the tree. Define the internal path length, I, as the sum, taken over all the internal nodes of the tree, of the depth of each node. Lik

[amistry_petlad]

The other one is on binary tree. I do appreciate the guidline and how to prove that. Thanks, Amit

[R Giskard Reventlov]

Both of your questions sound a lot like homework. We don't do homework.

"If you think it's expensive to hire a professional to do the job, wait until you hire an amateur." Red Adair. nils illegitimus carborundum me, me, me

[Lost User]

See http://www.codeproject.com/Messages/2966804/How-to-get-an-answer-to-your-question.aspx[^].

Use the best guess

[amistry_petlad]

This question is from DATA STRUCTURE & Algorithms

[Lost User]

You have asked for someone else to do your work for you. That's not how things operate here.

Use the best guess

[Lutoslaw]

We have a tree spec and definitions for n and I. What is a statement to prove?

Greetings - Jacek