Binary Search Tree Time Complexity: Why O(log n) Isn't Guaranteed

You learn that a binary search tree gives you O(log n) search, insertion, and deletion. Then you feed it a sorted array of timestamps from a log and the tree degenerates into a linked list. Every sear