Compressed Trie: Patricia Tree and Radix Tree
Standard tries waste enormous amounts of memory. Consider storing the words ‘application’, ‘applicant’, and ‘apply’ in a traditional trie. You’d create 11 nodes just for the shared prefix ‘applic’,…
Read more →