use depth to find the depth of its left and right subtrees; its depth is then one plus their maximum
return(1 + max(depth(left(tree)),