Hi, Páll Haraldsson <pall.haralds...@gmail.com> writes: > I've been trying to implement some code to build Binary Search Trees. > > Is this a genuine need or an exercise? I quickly looked at Datastructures.jl:
a genuine need (well, not really the BSTs, but recursive data structures in general. In this thread I have another post where I explain that the goal for this was to implement a Barnes-Hut N-body simulation code, for which I need octtrees). > "The containers internally use a 2-3 tree, which is a kind of balanced tree > and > is described in many elementary data structure textbooks." > > Maybe you use their code or learn from it (assuming they best solve your > Nullable problem; that I didn't look into), or maybe you can help them if your > data structure is really needed. thanks, I will look into Datastructures.jl (though by now I already have three alternative ways of implementing BSTs, as I posted this morning). Thanks, -- Ángel de Vicente http://www.iac.es/galeria/angelv/
