From: Joel VanderWerf <vjoel@...>
Date: 2002-09-03T14:42:05+09:00
Subject: Re: Efficient construction of a L/R minmax tree

Lachlan Pitts wrote:
...
> I need an algorithm that paints the entire tree with L and R
 > values such that any ancestor's L and R values strictly bound
 > all its descendants L and R values.  (A sort of pre-stored
 > transitive closure approach).

...and such that the [L,R] intervals of siblings are disjoint?

Otherwise you can take L = 0, R = 2*depth for the root and do L--, R++ 
for each level down...