Now showing items 1-1 of 1

    • Improving time and space efficiency of trie data structure 

      Kale, Nirmik Milind; 0000-0001-7455-0089 (2018-08-15)
      Trie or prefix tree is a data structure that has been used widely in some applications such as prefix-matching, auto-complete suggestions, and IP routing tables for a long time. What makes tries even more interesting is ...