Skip to content
Discussion options

You must be logged in to vote

A binary search tree stores data and retrieves it very efficiently.
The left sub-tree contains nodes whose keys are less than the node’s key value.
The right sub-tree contains nodes whose keys are greater than or equal to the node’s key value. When it comes to modern day programming, binary search trees can make it very easy for programmers to gather and retrieve data easily.

Replies: 1 comment

Comment options

You must be logged in to vote
0 replies
Answer selected by Kuefo
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
2 participants