Complexity Of Determining Tree is balanced?
Your getHeight method could be simpler (and more correct) if it was handling the null case.

int getHeight(Node N) {
    if (N==null) return 0
    return 1 + Max(getHeight(N.L),getHeight(N.R));
}


Also, I think you should have a read at this quite similar question.