In what case search function in binary search tree will have O(h + s) complexity, where h is the height and s is item returned?

Question

In the balanced BST search function takes O(logn) depending on key value that compares and traverse left or right subtree. In what case search function takes O(h +s) operation?

Answer 1

Oh, wow. Great question. You may want to ask this in a computer science discord or reddit page. Sololearn is more so about programming that computer science.