recategorized by
598 views

1 Answer

0 votes
0 votes

optimal binary search tree (Optimal BST), sometimes called a weight-balanced binary tree which provides the smallest possible search time or a given sequence of accesses (or access probabilities).

Optimal BSTs are generally divided into two types: static and dynamic

In the static optimality problem, the tree cannot be modified after it has been constructed

in the dynamic optimality problem, the tree can be modified at any time.

reference https://en.wikipedia.org/wiki/Optimal_binary_search_tree

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
1 answer
2
supraja asked Apr 28, 2015
4,207 views
Given the following table of data what are the minimum expected no.of comparisons required for an Optimali01234Pi 3/163/161/161/16Qi2/163/161/161/161/16BST that can be co...
1 votes
1 votes
0 answers
3
Anjan asked Jan 9, 2018
325 views
Find number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having 6 as root and height of 4 ?please explain in detail ...
3 votes
3 votes
2 answers
4
VS asked Jan 3, 2018
798 views
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 �...