optimal-binary-search-tree
Here are 14 public repositories matching this topic...
Sort:Most stars
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
Dec 24, 2024 - C++
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
My Data-Structures and Algorithms codes for CSE 203 Course.
- Updated
Jul 6, 2019 - C++
Analyse expérimentale du coût et des défauts de localité: application à un Optimal Binary Search Tree
- Updated
Jun 30, 2021 - C
Huffman coding implementation
- Updated
Aug 5, 2021 - Go
Dynamic programming OBST
- Updated
Mar 30, 2022 - Python
- Updated
Mar 25, 2021 - Python
- Updated
Apr 20, 2019 - C++
Optimal binary search tree using dynamic programming.
- Updated
Dec 9, 2022 - Java
Optimal binary search tree using dynamic programming.
- Updated
Jun 5, 2022 - Java
Optimal Binary Search Tree
- Updated
Dec 11, 2018 - Python
Spring 2023 NYCU Introduction to Algorithm
- Updated
Apr 7, 2025 - C++
Improve this page
Add a description, image, and links to theoptimal-binary-search-tree topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with theoptimal-binary-search-tree topic, visit your repo's landing page and select "manage topics."