Friday, 24 March 2017

Balanced search trees: red-black trees

The F# Journal just published an article:

"This is the first article in a series about balanced search trees. There are many different kinds of balanced trees. This article takes a look at a very popular data structure called red-black trees. In particular, we go further than many other texts on purely functional red-black trees by including a delete operation that removes an element from a tree..."

If you subscribe to the F# Journal then can read this article here otherwise subscribe to the The F# Journal today to read this article and many more!

No comments: