For a more robust implementation, please Refer to https://github.com/tsinghua-ideal/ExtendibleRadixTree
If you use this code in your research, please kindly cite the following paper.
Ke Wang, Guanqun Yang, Yiwei Li, Huanchen Zhang, and Mingyu Gao. When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories. Proc. ACM Manag. Data, Vol 1, No 1, Article 105 (SIGMOD). 2023.