A binary search tree is a data structure where each node has at most two children, and left child < parent < right child.
Check out GeeksforGeeks BST tutorial for more information.
