[edirol]

I'm writing a random tree and would like to track the height of the subtrees in the node. What method should this count be tracked in? Should this be a recursive call everytime a node is added?

[Sadaiy]

Like so:

findHeight(BinaryTree aBinaryTree)
{
if (aTree.isEmpty())
return 0;
else
{
int heightLeft=height(aTree.getLeftSubtree());
int heightRight=height(aTree.getRightSubtree());
if (heightLeft >= heightRight)
return heightLeft+1;
else
return heightRight+1;
}

[edirol]

name edirol: date 28, Nov, 2008 12:31 pm

so i'll need a function findHeight that get calls everytime I add a node?

edirol

Sadaiy, on 28 Nov, 2008 - 12:27 PM, said:

Like so:

findHeight(BinaryTree aBinaryTree)
{
if (aTree.isEmpty())
return 0;
else
{
int heightLeft=height(aTree.getLeftSubtree());
int heightRight=height(aTree.getRightSubtree());
if (heightLeft >= heightRight)
return heightLeft+1;
else
return heightRight+1;
}

[Sadaiy]

No, you create the tree first. Then when you want to find the height you run the findHeight function once(it is recursive).

[edirol]

I don't have a clear conception of when you should find height in a random binary tree. Are you able to explain this?

Sadaiy, on 28 Nov, 2008 - 01:50 PM, said:

No, you create the tree first. Then when you want to find the height you run the findHeight function once(it is recursive).

[edirol]

How do I know when I want to find the height?

edirol, on 28 Nov, 2008 - 01:56 PM, said:

I don't have a clear conception of when you should find height in a random binary tree. Are you able to explain this?

Sadaiy, on 28 Nov, 2008 - 01:50 PM, said:

No, you create the tree first. Then when you want to find the height you run the findHeight function once(it is recursive).

[Sadaiy]

Well, I don't know when you want to find the height.. Usually after the tree has been comepletely built (all nodes have been added), then you can find the height of it if you want too.