Re: How might I handle a special tree?

Each node in the tree should be unique, and each node has two attributes: whether or not it appears in "list #1" and whether or not in "list #2."

Comment on Re: How might I handle a special tree?

Replies are listed 'Best First'.
Re^2: How might I handle a special tree? by Anonymous Monk on Dec 08, 2014 at 22:18 UTC
That makes no sense as a solution to the OP's question.	[reply]
Re^2: How might I handle a special tree? by vitoco (Hermit) on Dec 09, 2014 at 01:26 UTC
The nodes in the original list are unique, and actually are the keys of some hashes, and the order in the list is based on one of them. The new ones (branches) are labels that group some old nodes based on values from other hash, and it's name will not duplicate any existing key. Being the first element of any nested list is enougth to know the type of it. I think I'll start with about a thousand nodes in a list, and I don't know how "tall" the resulting tree will be. It'll depend on some tunning of the parameters.	[reply]