How do you find the height of a tree?

Answer 1

struct node { int payload; struct node *left, *right; };

int height(struct node *tree) {

if (tree == NULL) return 0;

return 1 + max (height (tree->left), height (tree->right));

}

Answer 2

There is a pseudo-code description of an algorithm at http://www.eecs.umich.edu/~qstout/abs/CACM86.html (the site explains the basic idea, and points to the paper that has the detailed algorithm). The tree produced is perfect, in that it has minimal height and a minimal number of nodes at the maximum depth. It is easy to turn the pseudo-code into code in any language. Quentin F. Stout A disclosure: it's one of my pages.

Answer 3

By making a simple ratio and using cross multiplication. I've included a simple equation to accomplish this... here's how this works.

You must wait until day time when the tree is casting a shadow. Take a stick or something else that is short enough to measure its height and push it into the ground vertically and straight. Measure the object's height, base to top, and its shadow, base to the end of the shadow. Make sure to right these numbers down because you will need them later.

Next, measure the shadow the tree is casting.

Now, using your recorded numbers, you can roughly estimate the trees height. Using this equation ---> (ObjectHeight * TreeShadow / Object Shadow = TreeHeight) should give you the trees height fairly accurately. Just make sure you make all your measurements in the same unit of measurement (i.e. inches, feet, cm, etc.)

Answer 4

Because a binary trees height has nothing to do with the number of items in the tree you will have to find the longest branch by walking the tree node by node.

When you get into the real world a "B tree" is used, if you get to these you will like them over binary (red/black) trees.

Answer 5

with a mesuring tape or yard stick