Binary Search Tree

Binary Tree
Announcement / Release
around 1960
Birth Place
London, England, United Kingdom of Great Britain and Northern Ireland


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. They allow fast lookup, addition and removal of items, and can be used to implement either dynamic sets of items, or lookup tables that allow finding an item by its key

Something Missing? Feel Feel to Help Fix It - Sign up !