Hi,
Páll Haraldsson 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 ano
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
Hi,
hubert_tiey...@t-online.de writes:
> Hi,
>
> I've been trying to implement some code to build Binary Search
> Trees. The code below works, I'm able to build a tree and then print
> it
> in ascending order, but it is quite ugly, with those Nullable types
Am Donnerstag, 27. Oktober 2016 16:03:27 UTC+2 schrieb Ángel de Vicente:
Hi,
>
> I've been trying to implement some code to build Binary Search
> Trees. The code below works, I'm able to build a tree and then print it
> in ascending order, but it is quite ugly, with those Nullable types and
