On Thursday, October 27, 2016 at 2:03:27 PM UTC, Ángel de Vicente wrote: > > Hi, > > 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: "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. > -- > Ángel de Vicente > http://www.iac.es/galeria/angelv/ >
