Purely functional data structure
In computer science, a purely functional data structure is a data structure that can be directly implemented in a purely functional language. The main difference between an arbitrary data structure and a purely functional one is that the latter is (strongly) immutable.
Source: Wikipedia — Purely functional data structure (CC BY-SA 4.0)