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

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.

Language: Jupyter Notebook - Size: 3.91 KB - Last synced at: 6 days ago - Pushed at: over 4 years ago - Stars: 2 - Forks: 1