Comment by wpears

BST is O(n) in the worst case (when a tree is completely unbalanced and is essentially a linked list)