I decided to give Zig a fair shake and implemented a quick tree insertion algorithm. On one hand it's very explicit and that's quite nice. But at the same time it feels like the way it forces you to handle pointers and allocation is a bit of a pain when compared C++.
I can see why it's done that way and it can lead to very safe code. But it does seem to be a bit much.