feat: Binary Search Tree #25
Labels
data structure
Issues relating to the Data Structures.
hacktoberfest
tree
Issues relating to the Tree Data Structures.
Binary Search Tree
Description
Implementation of Binary Search Tree or BST which is one of the basic tree data strucuture.
Definition
In computer science, binary search trees (BST), sometimes called ordered or sorted binary trees, are a particular type of container: 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 (e.g., finding the phone number of a person by name).
Reference Implementations
The text was updated successfully, but these errors were encountered: