This (quite sudden) post is about a hypothetical data structure I have thought of one day in my dreams, and this won't be a series (I am yet a student, which means I don't have time to invent data structures all day and all night). Still, Thinking about this, I thought it would be a good idea to cover it on its own post. So here we are.
Concept
The traditional bit trie uses one leaf node for one number, and every leaf node has same depth.