think recursevely this problem

[transgalactic2]

a balanced tree is if its the difference between the left subtree
and the right subtree is smaller than 2.

i need to build a function which return 1 if the tree is balanced
and 0 if else.

how to store the height of each node from the ground?

[quzah]

Try one of the various data types which store numbers.

Quzah.

[slingerland3g]

Well you can create a height recursive function to determine the height.

int height (link t)
{
    int left,right;
    if (t == NULL) return -1;
    left = height(t->l); 
    right = height(t->r);
    if (left  > right)
      return left + 1; 
    else return right +1;
}

[quzah]

Or you can just wait around and someone will do everything for you AGAIN!


Quzah.