Given a list of frequencies, generate a binary search search tree such that the average cost for a FIND operation is optimal. Give the worst case, best case, average case and standard deviation for a FIND operation on the generated tree.
-
Notifications
You must be signed in to change notification settings - Fork 0
Given a list of frequencies, generate a binary search search tree such that the average cost for a FIND operation is optimal. Give the worst case, best case, average case and standard deviation for a FIND operation on the generated tree.
evanbell123/OptimalBinarySearchTrees
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Given a list of frequencies, generate a binary search search tree such that the average cost for a FIND operation is optimal. Give the worst case, best case, average case and standard deviation for a FIND operation on the generated tree.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published