Tag Archives: red-black tree

Statically typed red-black trees

I have met with claims that the static typing is useless as it is not mathematical proof (OK – for those knowing the discussion – I exaggerated a lot). However to large extend the static typing is prove of some … Continue reading

Posted in Programming | Tagged , , | Leave a comment