Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: Binary Search Tree #25

Open
inf3cti0n95 opened this issue Mar 8, 2019 · 0 comments
Open

feat: Binary Search Tree #25

inf3cti0n95 opened this issue Mar 8, 2019 · 0 comments
Assignees
Labels
data structure Issues relating to the Data Structures. hacktoberfest tree Issues relating to the Tree Data Structures.

Comments

@inf3cti0n95
Copy link
Owner

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

@inf3cti0n95 inf3cti0n95 added tree Issues relating to the Tree Data Structures. data structure Issues relating to the Data Structures. labels Mar 8, 2019
@inf3cti0n95 inf3cti0n95 self-assigned this Mar 8, 2019
inf3cti0n95 added a commit that referenced this issue Mar 11, 2019
affects: @sidekik/binary-search-tree

added BinaryNode and BinarySearchTree classes for implementation of BinarySearchTree

ISSUES CLOSED: #25
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
data structure Issues relating to the Data Structures. hacktoberfest tree Issues relating to the Tree Data Structures.
Projects
None yet
Development

No branches or pull requests

1 participant