> Operations on stack can be realised via
> Resize_Array macro.

  The problem with using Resize_Array() is that it defies the whole purpose
of using binary trees. The main reason of using trees is that adding,
removing and searching values are all O(log n) operations, which makes it
awesomely fast.
  However, if you have to recurr to Resize_Array(), you are making it O(n),
which effectively destroys its speed benefits.

-- 
#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