BST access time will be worst in the term of time complexity is O(n^2) O(1) O(nlogn) O(n) code example

Example: binary search time complexity

Average case:O(log n)
Best case:O(1)