If there is a pair with sum equal to - 1 * head -> key , then return true else move forward
if ( isPresentInDLL ( head -> right , tail , -1 * head -> key ) ) return true ; else head = head -> right ; }