Ron Parker <ron### [at] povrayorg> wrote:
> A binary tree can always be put in a 1-d array.  It's simple: Given a
> cell with index n, the left child of that cell is at index n*2 and
> the right child of that cell is at index n*2+1.  The parent of that
> cell is, obviously, at index int(n/2).  A few macros to implement that
> scheme and there you go.

  Yes, but would it be as fast as a regular binary tree (ie one where
items are allocated dynamically and which contains pointers to children)?
For example adding a new item or removing an item can be slow.

-- 
#macro M(A,N,D,L)plane{-z,-9pigment{mandel L*9translate N color_map{[0rgb x]
[1rgb 9]}scale<D,D*3D>*1e3}rotate y*A*8}#end M(-3<1.206434.28623>70,7)M(
-1<.7438.1795>1,20)M(1<.77595.13699>30,20)M(3<.75923.07145>80,99)// - Warp -

Post a reply to this message