[Haskell-cafe] bit of help with n-ary please...

[Casey Hawthorne]

I don't know if this is homework.

I suppose what you mean is the following: I'm trying to replace an
element in an n-ary tree and display the completed tree.

A more precise specification might help.
- is the tree ordered
- are all the elements in the leaves (not internal nodes)
- is the location of the element to be replaced given?
-- if so how?
- is the tree supposed to be balanced?



On Sun, 8 Nov 2009 15:40:03 -0800 (PST), you wrote:

>
>
>Anybody? thanks
>
>
>
>
>spot135 wrote:
>> 
>> 
>> Hi,
>> 
>> Ok what im trying to do is replace an element in an n-ary and display the
>> completed tree.
>> 
>> So this is what ive got so far.
>> 

<snip>

--
Regards,
Casey