Author here. While researching this topic I came across this article https://www.geeksforgeeks.org/compressed-tries/ by GeeksForGeeks (compressed trie is another name for radix tree). Currently it is one of the top results on Google for this topic. Generally I've found GeeksForGeeks to be a good resource, but this article is especially poor. The code is bizarre and makes no sense:
- It defines properties like 'bitNumber', 'leftChild' and 'rightChild' which have nothing to do with this type of tree.
- The search function search(k) calls an overloaded version of itself search(root, k) that is (1) illegal in these languages and (2) not defined.
- The insert function does not account for all scenarios.
And more.
I'm fairly convinced this was written with the assistance of a LLM. That would be a logical explanation to all those illogical choices.
- It defines properties like 'bitNumber', 'leftChild' and 'rightChild' which have nothing to do with this type of tree.
- The search function search(k) calls an overloaded version of itself search(root, k) that is (1) illegal in these languages and (2) not defined.
- The insert function does not account for all scenarios.
And more.
I'm fairly convinced this was written with the assistance of a LLM. That would be a logical explanation to all those illogical choices.