Skip to content

Given a document, dictionary was created using optimal binary search tree for this document where words with highest term frequency appear near the root of OBST. And when a word from user-input is to be found in this OBST-Dictionary, output the level in OBST at which this word was found.

Notifications You must be signed in to change notification settings

ritu-thombre99/Optimal-Binary-Search-Tree-for-Dictionary-Implementation

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 

About

Given a document, dictionary was created using optimal binary search tree for this document where words with highest term frequency appear near the root of OBST. And when a word from user-input is to be found in this OBST-Dictionary, output the level in OBST at which this word was found.

Topics

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published