Update on Functional Data Structures in R

The manuscript for Functional Data Structures in R is coming along nicely. I’ve just finished the description of red-black search trees. Insertion there is simple, but deletion requires a bit more work.

I added some code for visualising trees and some experiments with runtime performance.

Now I want to go back through the previous chapters and update those with more experiments and visualisation, and also include some of the experiment code. I plan to do this before I return to the search tree chapter and write about splay trees.

Like what you read? Give Thomas Mailund a round of applause.

From a quick cheer to a standing ovation, clap to show how much you enjoyed this story.