In computer science, binary search trees (BST), sometimes called ordered or sorted binary trees, are a particular type of containers: data structures that store "items" (such as numbers, names etc.) in memory. This topic covers binary search trees: Abstract Sorted Lists, background, definition and examples,.