Binary search tree

A binary search tree (BST) is a binary tree where every node has a value, every node's left subtree contains only values less than or equal to the node's value, and every node's right subtree contains only values that are greater than or equal. The time complexity of searching for a value in a BST is ${\displaystyle O(log(n))}$