Skip to content
#

optimal-binary-search-tree

Here are 13 public repositories matching this topic...

This is the implementation of 3rd Part in 3-Part Series of Algorithms Illuminated Book. All Implementations in this repository are written in both Python and Golang. Single IPython Notebook contains all Algorithms given in this Part 3.

  • Updated Apr 7, 2021
  • Jupyter Notebook

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.

  • Updated Nov 11, 2020
  • Jupyter Notebook

Improve this page

Add a description, image, and links to the optimal-binary-search-tree topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the optimal-binary-search-tree topic, visit your repo's landing page and select "manage topics."

Learn more