Clojure: How to generate a 'trie'?

Question

Given the following...

(def inTree
 \'((1 2)
   (1 2 3)
   (1 2 4 5 9)
   (1 2 4 10 15)
   (1 2 4 20 25)))

How would you transform it to this t

Answer 1

As a general approach, here's what I would do:

• Write a few functions to create a trie and to insert new elements into a trie.
• Create a new trie.
• Iterate through the input list and insert each element into the trie.

This problem lends itself very well to a recursive implementation. I would aim for that if possible.