Thursday, 30 March 2017

Balanced search trees: weight-balanced trees

The F# Journal just published an article:

"This article continues our series about balanced search trees by covering weight balanced trees. This data structure can be remarkably simple and performance is good enough for many applications, making it an ideal pedagogical example that can be used to teach general tree-based techniques. Furthermore, this data structure allows some operations to be implemented asymptotically more efficiently than most other search trees including the AVL trees used inside the F# `Set` and `Map` modules..."

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: