int depth(tnode<char>* t)
{
int leftd;
int rightd;
int d;
if (t == NULL) d = -1;
else
{
leftd = depth(t->left);
rightd = depth(t->right);
d = 1 + (leftd > rightd ? leftd : rightd);
}
return d;
}