There are RCU safe trees like the maple tree in Linux: https://docs.kernel.org/core-api/maple_tree.html https://docs.kernel.org/core-api/maple_tree.html The tl

There are RCU safe trees like the maple tree in Linux: https://docs.kernel.org/core-api/maple_tree.html https://docs.kernel.org/core-api/maple_tree.html The tl;dr is that it uses garbage collection to let readers see the older version of the tree they were walking while the latest copy still gets updated. I read a paper recently about concurrent interval skip lists the other day as well which was interesting.