What is the worst-case time complexity of searching an element in a Binary Search Tree?O(1)O(log n)O(n)O(n log n)

What is the worst-case time complexity of searching for an element in a balanced binary search tree in the worst case?Group of answer choicesO(1)O(n^2)O(n)O(log n)

What is the average time complexity for searching an element in a binary search tree?Group of answer choicesO(1)O(n)O(log n)Depends on the tree structure

What is the time complexity of Binary Search in the worst case?

If n elements are sorted in a balanced binary search tree. What would be the asymptotic complexity to search a key in the tree? a. O(n) b. O(1) c. O(logn) d. O(nlogn)

What is the time complexity (worst case) of a binary search in an array of size n?O(n^2)O(log(n))O(1)O(n!)