In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?