###### Table of Contents - [[]] - [[]] - [[]] - [[]] ### When should I use a binary search tree? In any situation where the elements of a collection can be compared in a greater than less than manner. ### What are some real world examples? - Database indexes - Repeated lookups through long, ordered data sets (e.g., a contact list data set) - Git bisect ### Common BST Interview Questions - Search for a given key in a BST - Calculate the height of a BST - Determine if a BST is valid - Difference between depth-first search and breadth-first search #### More info [Some website](https://test.com) ___ **Tags**: #data-structures #algos #bst