Home/Lessons/DSA/Binary Search Trees — ordered lookup in O(log n)← All lessonsAdvanced·13 min·dsa · trees · binary search tree · bst · interviewBinary Search Trees — ordered lookup in O(log n)Loading lesson…← PreviousBinary Trees — traversals and recursionNext →Graph Representations — adjacency list, matrix, edge list