Binary Search Tree Implementation in C++
Published in
3 min readJul 25, 2019
Binary search tree(BST) is a kind of binary tree(tree where each node has at most 2 child nodes) where any node of the tree will be less than all its right children and greater than all its left children. For Instance
To implement BST will implement three things that we can do on a BST:
- Insertion
- Search
