Data structures — Binary Search Trees
4 min readJun 23, 2020
An introduction to Binary Search Trees and some common methods for this data structure.
What are Binary Search Trees?
Binary Search Trees is a type of data structure to store data in an ordered way. This data structure consists of nodes, and each node has at most two child nodes. The order of these nodes follow a property called the BST property. The BST…