Theoretically no, because Turing complete. Practically yes, there’re many well-known algorithms processing linked lists, trees and graphs. These algorithms are

Theoretically no, because Turing complete. Practically yes, there’re many well-known algorithms processing linked lists, trees and graphs. These algorithms are used everywhere in practice, processing syntax/expression/DOM/filesystem trees, MRU/LRU lists, objects/dependencies/network/pathfinding graphs. Safe rust implementation of these structures wastes too much resources.