Finding the Internal Path Length (not work/school related) - Programmers Heaven

#### Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

#### Categories

Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

# Finding the Internal Path Length (not work/school related)

Posts: 1Member
The question was: Write a recursive program that computes the internal path length of a binary tree in time proportional to the number of nodes in the tree.

I have the program, but I'm not sure if it meets the criteria.
[code]
int GetInternalPathLength (link root, int curLevel = 0)
{
// Check if this node is external. If it is,
// don't count its level as part of the IPL.
if (root -> leftChild == NULL && root -> rightChild == NULL)
{
return 0;
}

// Add this node's level and the IPL of it's
// subtrees to the TOTAL IPL.
return curLevel +
GetInternalPathLength (root -> leftChild, curLevel + 1) +
GetInternalPathLength (root -> rightChild, curLevel + 1);
}
[/code]
Is this proportional to N?

• Posts: 228Member
Hi,

well, i think it is correct.
Cheers.
Alex

: The question was: Write a recursive program that computes the internal path length of a binary tree in time proportional to the number of nodes in the tree.
:
: I have the program, but I'm not sure if it meets the criteria.
: [code]
: int GetInternalPathLength (link root, int curLevel = 0)
: {
: // Check if this node is external. If it is,
: // don't count its level as part of the IPL.
: if (root -> leftChild == NULL && root -> rightChild == NULL)
: {
: return 0;
: }
:
: // Add this node's level and the IPL of it's
: // subtrees to the TOTAL IPL.
: return curLevel +
: GetInternalPathLength (root -> leftChild, curLevel + 1) +
: GetInternalPathLength (root -> rightChild, curLevel + 1);
: }
: [/code]
: Is this proportional to N?
:
: