int height(TREE *root)
{
   int height_left, height_right;

   if(root==NULL) 
      return(-1);
   height_left=height(root->left); 
   height_right=height(root->right); 
   return((height_left>height_right) ? height_left+1 : height_right+1);
}