Tree Algorithm

James Coupe james at
Thu Dec 31 17:56:42 GMT 2009

ian <londonperlmongers at> wrote:
> * Every node has a left and a right value and a level
> * For any given node, all of it's descendents left values lie between
>the nodes left and right values.
> * For a leaf node, it's right value equals it's left value + 1
> * All children of a parent will therefore be those with node numbers
>between the parents left and right values and one level deeper.

Nested Sets?

Some discussion here, although without giving a proper name to the

James Coupe

More information about the mailing list