In this paper, we study the traceability of locally in(out)-semicomplete digraphs and extended locally in(out)-semicomplete digraphs by multi-insertion technique. First, we show that for a connected locally in-semicomplete digraph D of order n, if for every dominated pair of non-adjacent vertices {x, y}, either d(x)≥n-1 and d(y)≥n-2, or d(x)≥n-2 and d(y)≥n-1, then D is traceable. At the same time, we show for a connected locally in-semicomplete digraph D of order n, if for every dominated pair of non-adjacent vertices {x, y}, min{d+(x)+d-(y), d-(x)+d+(y)} ≥n-1, then D is traceable. Second, we show that for a connected extended locally in-semicomplete digraph D of order n, if D is satisfied with the following two conditions: (1) for every dominated pair of non-adjacent vertices {u, v}, d(u)≥n-1, d(v)≥n-1; (2) for every dominated pair of non-adjacent vertices {x, y}, either d(x)≥n-1 and d(y)≥n-2 or d(x)≥n-2 and d(y)≥n-1, then D is traceable. Finally, by the properties of reversing digraphs, we generalize these three results to locally out-semicomplete digraphs and extended locally out-semicomplete digraphs.