Add OBST algorithm implementation in C++#238
Open
Praneel-Shivarkar wants to merge 3 commits intoSjxSubham:mainfrom
Open
Add OBST algorithm implementation in C++#238Praneel-Shivarkar wants to merge 3 commits intoSjxSubham:mainfrom
Praneel-Shivarkar wants to merge 3 commits intoSjxSubham:mainfrom
Conversation
Implement Optimal Binary Search Tree algorithm.
Reviewer's guide (collapsed on small PRs)Reviewer's GuideThis PR adds a C++ implementation of the optimal binary search tree algorithm, using dynamic programming to compute minimal search costs and reconstruct the tree structure from computed root indices. File-Level Changes
Tips and commandsInteracting with Sourcery
Customizing Your ExperienceAccess your dashboard to:
Getting Help
|
Owner
|
@Praneel-Shivarkar raise an ISSUE as well regarding the problem |
Author
|
@SjxSubham can you please merge this? |
Owner
|
@Praneel-Shivarkar no need to be hurry...make these changes
|
SjxSubham
requested changes
Oct 28, 2025
Owner
There was a problem hiding this comment.
change file name ...
rename the file name as ProblemNo. PRoblem Name.cpp
Owner
There was a problem hiding this comment.
@Praneel-Shivarkar after this above changes I'll merge ur PR
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Problem Statement: Given sequence k = k1 <k2 < … <kn of n sorted keys, with a search probability pi for each key ki . Build the Binary search tree that has the least search cost given the access probability for each key?
Summary by Sourcery
New Features: