Hey all, I’m building my own little app (side project) and I’m looking for a tree data structure. I’m honestly wondering if I’m overlooking something but I couldn’t find a library that’s right for me.

The whole thing should be “generic” (think, like a DOM), i.e., like this:

1. Arbitrary number of children per node.
2. Children are ordered.
3. Easy to traverse. E.g. there should be “get sibling right after this”, “get parent” etc.
4. Effiiciently find child by node ID (no zipper; I wanna build a microservice that manages the tree)

I could use a digraph from Erlang but it’s actually too flexible for my use case and would require a wrapper around it to make sure nobody’s creating a loop.

In particular 5. seems hard to satisfy with the libraries I found.

Do you guys agree that there’s currently no library that does this? Any advice on how I would build this without going crazy?

Thanks a lot!