What is the computational complexity of inserting an item into a binary search tree in the worst case in terms of Big O notation?

$O(n)$

$O(n^2)$

$O(logn)$

$O(nlogn)$

O$(1)$