Warp wrote:
> Btw, a balanced binary search tree has all those properties and then> some.
Random musing:
BST (binary search tree) sounds confusingly similar to BSP (binary space
partitioning).
If you think about it, a BST is kind of vaguely like 1D BSP.
I wonder if any BST self-balancing algorithms are applicable to BSP?
--
http://blog.orphi.me.uk/
http://www.zazzle.com/MathematicalOrchid*
