- type of [[Binary Trees|Binary Tree]] with specific property: - for each node, all values in its left subtree are less than the value of the node - all values in its right subtree are greater than the value in the node - (property also implies that values in BST must be unique) - to find a specific value, average runtime is $O(logn)$ - but if it was just straight line, time complexity would be $O(n)$ - an inorder [[DFS]] traversal prioritizing left before right on a BST will handle nodes in sorted order ![[CleanShot 2024-05-24 at 13.56.50.png|500x400]]