MadeEasy Test Series 2018: Programming & DS - Binary search Tree

Question

Consider a Binary Search Tree is created using element 1 to n in following order:

                      3, 2, 1, 6, 5, 4, 9, 8, 7, 12, 11, 10, ....., n – 3, n – 4, n – 5, n – 2, n – 1, n

What is the worst time complexity of searching a number in the Binary Search Tree?

Comments

For large number n, O(n) ?

---

answer given is : O(logn)

---

same question and already answered https://gateoverflow.in/189303/bst-test-series

Answer 1

time complexity would be O(n)

since the height will be n/3