Internal Path Length

[patrick210]

Not to sound like a total moron, but is there a way to find the Internal Path Length using code? I am looking for a way to capture the count of all the internal nodes and their level to get the Internal Path Length, so I can in turn find the Average Path Length.

Any suggestions?

[Peter_APIIT]

I odn't understand what u mentioned here.

Please explain a bit otherwise we cannot help you.

[patrick210]

we are basically writing a program to take random numbers and build a binary search tree. I wanted to know if there is a way to capture the amount of internal nodes and the level each is on, so you can determine the Internal Path Length. Then I can the Average Path Length by dividing the IPL by the amount of records. I want to see if there was a way to capture this info.

[jonnin]

Well, if its a search tree its balanced (or someone, somewhere is WRONG). If its balanced, the number of nodes tells you the average path length ... there is not much work to do, its a straight up computation. If for some insane reason its not balanced, you can do any of the standard tree traversals to generate a table of info that would let you compute this, but IMO your time would be better spent writing a better search tree.