If you use a simple binary tree, which nobody does, you're right. If you use a red-black tree, like everybody does, you're wrong; worst case search time for a balanced binary tree is O(log n).

Worst case search for a radix trie is always O(k); radix tries don't require balancing.

Where did you go to school?