time complexity to build a binary search tree code example Example: binary search time complexity Average case:O(log n) Best case:O(1)