The worst case of a tree is a linear tree. Such a tree has one single leaf, and all other nodes are in a chain from the root to the single leaf. If a binary search tree is like this, then the time complexity to search for a value is Θ(n), which is the same as a linear search algorithm.