Update: all the code can be downloaded from here
This is my implementation of a a prefix tree data structure in F#.
This structure is described in more detail in a previous post of mine.
I just describe the F# related stuff in the comments.
I'm sure this is not the best implementation. I am aware this is not the most functional implementation ever.
I am open to all constructive criticism of course.
Abonați-vă la:
Postare comentarii (Atom)
The Trie: A Neglected Data Structure
From the very first days in our lives as programmers , we’ve all dealt with data structures: Arrays, linked lists, trees, sets, stacks and...
Greeeat.
RăspundețiȘtergere