2 votes 2 votes 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? DS data-structures binary-search-tree made-easy-test-series + – charul asked Jan 23, 2018 • recategorized Jul 6, 2022 by Lakshman Bhaiya charul 531 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply gauravkc commented Jan 23, 2018 reply Follow Share For large number n, O(n) ? 0 votes 0 votes charul commented Jan 23, 2018 reply Follow Share answer given is : O(logn) 0 votes 0 votes Sambit Kumar commented Apr 17, 2018 reply Follow Share same question and already answered https://gateoverflow.in/189303/bst-test-series 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes time complexity would be O(n) since the height will be n/3 aaybachelor answered Apr 17, 2018 aaybachelor comment Share Follow See all 0 reply Please log in or register to add a comment.
