if height of tree left < height of tree right, then height of tree (node (v, left, right)) = (height of tree right) + 1