Knowing The Definition of a Trie Data Structure should be all you need to know how to implement a trie ADT. It's a structure where all the true (key,value) pairs are in the external nodes, and the guide keys/values are in the internal nodes. Examples of Trie Data structures are B+ Trees, B* Trees, Huffman Coding Trees, PR Quad Trees, PM QuadTrees, PM Octrees, etc. For a B+ Tree in particular, all you need to do is when you split a leaf (when it becomes full), pick the median of the leaf and that will be the guide value to the respective split left and right leafs. But each leaf and internal node can only contain a maximum of m children nodes, which is a B+ Tree of order m.
On Jul 30, 6:45 am, AMAN AGARWAL <mnnit.a...@gmail.com> wrote: > Hi, > > Can somebody please give me code snippet for implementing trie data > structure??? > -- > AMAN AGARWAL > "Success is not final, Failure is not fatal: It is the courage to continue > that counts!" -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
