Return maximum of 3 values : 1 ) Root 's data 2) Max in Left Subtree 3) Max in right subtree
int res = root -> data ; int lres = findMax ( root -> left ) ; int rres = findMax ( root -> right ) ; if ( lres > res ) res = lres ; if ( rres > res ) res = rres ; return res ; }