Binary Search Trees (BST) are ordered trees with the property that in a given node, the elements that compose the left sub-tree are smaller than the node and those in the right sub-tree are greater. This property is referenced as the binary search tree property. The property is propagated to the sub-trees (Figure 1). One [...]
Archive for the ‘Data Structures’ Category
Optimized search of BST in Haskell
Posted in Computer Science, Data Structures, Haskell, tagged Binary Search Tree Property, Binary Search Trees, BST, Haskell, Optimisation on May 16, 2010 | Leave a Comment »
