2 2 votes Consider the problem of construction of a minimum cost binary search tree for a given set of ‘$n$’ identifiers with their respective probabilities. The time complexity of the most efficient algorithm of the same is $O(n^2)$ $O(n^3)$ $O(n\log n)$ $O(n^3\log n)$ Data Structures data-structures binary-search-tree time-complexity ace-test-series + – `JEET 721 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes The identifiers and their probablities are assumed to be their weights. Thus forming new BST will take O(nlogn) time. Hence option C is correct rish1602 answered Jun 16, 2021 rish1602 comment Share Follow 0 reply Please log in or register to add a comment.
