int height( BinaryTree Node t) {

if t is a null tree

return -1;

hl = height( left subtree of t);

hr = height( right subtree of t);

h = 1 + maximum of hl and hr;

return h;

}

==============