FazBrowse GitHub Viewer | Trending |
URL:
| Home
Tools: [Download Repo ZIP]   [Original HTTPS Page]

optimal-binary-search-tree · GitHub Topics · GitHub

#

optimal-binary-search-tree

Here are 14 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

C++ implementation and visualizer for Optimal Binary Search Trees, focusing on dynamic programming and GCC optimization.

  • Updated Jul 3, 2026
  • Makefile

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

Analyse expérimentale du coût et des défauts de localité: application à un Optimal Binary Search Tree

  • Updated Jun 30, 2021
  • C

NYCU 2025 Spring Algorithms 陽明交大 荊宇泰 演算法

  • Updated Jun 1, 2026
  • C++

Huffman coding implementation

  • Updated Aug 5, 2021
  • Go

Dynamic programming OBST

  • Updated Mar 30, 2022
  • Python

a dynamic programming exercise

  • Updated Jan 18, 2020
  • C++

Optimal Binary Search Tree

  • Updated Dec 11, 2018
  • Python

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


Back | FazBrowse Home | New Git URL