Ask
Login
0
11kviews
Explain Optimal Binary Search Tree with an Example?
written 3.9 years ago by gravatar for nehetiw974 nehetiw974 • 30 modified 3.9 years ago by gravatar for DevarenjiniP DevarenjiniP • 3.2k
data structures and algorithms
ADD COMMENT EDIT
1 Answer
4
549views
written 3.9 years ago by gravatar for DevarenjiniP DevarenjiniP • 3.2k •   modified 3.9 years ago

OPTIMAL BINARY SEARCH TREES

  • A Binary Search Tree is one of the most important data structures which contain a set of elements with the operations of searching, insertion, and deletion.

  • An Optimal Binary Search Tree is the one for which the average number of comparisons in a search is the …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.