Thursday, 18 October 2007

Balanced Binary Search Trees

The F#.NET Journal just published an article describing the design and implementation of a basic balanced binary tree in F#:

"Functional programming languages like F# excel at handling immutable data structures. In the interests of efficiency, such data structures are typically based upon trees rather than hash tables. Key benefits include the ability to express algorithms elegantly using a declarative style and the inherent thread safety of immutable data structures makes them ideal for concurrent programming. This article describes the design and implementation of a basic balanced binary search tree data structure similar to that of the built-in Set module..."

To read this article and more, subscribe to The F#.NET Journal today!

No comments: