Are my recursion conditions right to compute binary tree height?

Question

I\'m trying to know whether my code is right or wrong with your help, because sadly I can\'t run it to check.

There are no compile errors. What I\'m trying to do is to

Answer 1

At first glance, as long as you pass in the head of the tree, it'll return the correct value. But it should have been easy to construct a test to validate this...