On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs