Thu Jul 13 22:21:52 CEST 2000
>>>>> "Ulf" == Ulf Wiger <> writes:
Ulf> What are the criteria for insertion? Are there split/merge thresholds?
Ulf> Why is for example 4 a child of 3?
Ulf> In any case, I wrote a walk/1 function and an insert/3 function,
Ulf> assuming that you need to identify the parent node when you insert.
Ulf> The walk/1 function is really tree_to_list/1.
This is exactly what I had in mind. So well done. Your recursion is
impressive. Is your walk_insert / walk_insert1 a common pattern ?
This is the kind of code that makes me love functionnal programming in general
and Erlang in particular...
Thanks you for _all_ your answers.
More information about the erlang-questions