1 votes 1 votes 8. What are the worst case and average case complexities of a binary search tree? a) O(n), O(n) b) O(logn), O(logn) c) O(logn), O(n) d) O(n), O(logn) Programming in C data-structures binary-search-tree binary-tree algorithms + – pradeepchaudhary asked Aug 19, 2018 • recategorized Jul 6, 2022 by Lakshman Bhaiya pradeepchaudhary 19.1k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply MiNiPanda commented Aug 19, 2018 reply Follow Share For which operation? Searching? 0 votes 0 votes Himanshu Kumar Gupta commented Aug 24, 2020 reply Follow Share yes for searching option D is correct 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes D: Worst case occurs when BST is skewed O(n); Best case occurs when it is Height Balanced O(logn) in case of insertion, search and delete operations Shiv Gaur answered Aug 19, 2018 Shiv Gaur comment Share Follow See 1 comment See all 1 1 comment reply Kaluti commented Aug 20, 2018 reply Follow Share Yes answer would be d 0 votes 0 votes Please log in or register to add a comment.