Re:Simple Trie Implementation in C++11
by bhaavan on Sunday July 21, 2019 @03:22PM
(#20493145)
Yes, it will, because map has O(1) GET operations, and that's all the trie needs.
In terms of space complexity, it does consume more space than a single element / node tree, (especially for maps with super low load factor) but trie data structure can accommodate all that extra space easily.
In terms of space complexity, it does consume more space than a single element / node tree, (especially for maps with super low load factor) but trie data structure can accommodate all that extra space easily.