Optimal Binary Search Tree using dynamic programming in DAA|OBST|DAA|Algorithms|Shortcut Tricks

Рет қаралды 19,021

8 ай бұрын

The Binary search tree that minimizes the expected search cost is called as Optimal Binary Search Tree(OBST). In a binary search tree, the search cost is the number of comparisons required to search for a given key.
This course was developed by Ahmad sir at CSE ACADEMY
optimal binary search tree part #2
🔗 • Optimal Binary Search ...
⭐ ALGORITHM COURSE CONTENT ⭐
🔗 Introduction to Algorithms
• INTRODUCTION TO ALGORI...
🔗 Definition of Algorithms
• ALGORITHM DEFINITION |...
🔗 Recurrence Relation
• RECURRENCE RELATION -1...
🔗 Master Method shortcut tricks
kzfaq.infoXboyzJwa...
🔗 BIOTONIC SORTING
• BIOTONIC SORTING|ALGOR...
🔗 AMORTIZED ANALYSIS
• Amortized Analysis || ...
#Optimal binary search tree using #dynamic programming
#optimal binary search tree #daa
#algorithmDesign and analysis of algorithms for gate
This problem is a partial, considering only successful search.
What is Binary Search Tree?
What is Optimal Binary Search Tree?
How to create Optimal Binary Search Tree by applying Dynamic Programming
Dynamic programming problems
Optimal binary search tree using dynamic programming
data structures and algorithms
design analysis of algorithms
design and analysis of algorithms
dynamic programming in daa
dynamic programming tutorial
introduction to algorithms
optimal binary search tree using dynamic programming
#dynamicprogramming
#ahmadsir
#viral
#shortcuttricks
#solvedexample
#cseacadmy
#best
#optimal binary search tree
#dynamic programming
#binary search tree
#Optimal binary search tree using #dynamic programming

Пікірлер: 26

@user-vk4zo7lf6z 8 ай бұрын

Wow such an amazing video, nice explain for very difficult problem , i see your lecture and solve in exam only 7 min , you are great Sir ur teaching methodology also unique THANK U SO MUCH sir

@CSEACADEMY1 8 ай бұрын

Thank u so dear for ur valuable comments

@user-re4cf1we6d 5 ай бұрын

Such an amazing video, thanks a lot sir

@CSEACADEMY1 5 ай бұрын

Thank u so much dear! Pls subscribe the channel and also share ur friends for more videos

@lakshayverma6557 29 күн бұрын

thanks a lot

@user-yh5gf5tg4f 7 ай бұрын

thank you sir very much appreciate you work❤❤❤

@CSEACADEMY1 7 ай бұрын

Welcome dear

@mani55555-b 8 ай бұрын

Best sir

@CSEACADEMY1 8 ай бұрын

Thank u so much dear

@mdshahjadaalam7380 8 ай бұрын

Nice ❤️

@CSEACADEMY1 8 ай бұрын

Thank you so much Sir ji

@joshbasnet3014 11 күн бұрын

Can i use this for 4x4 (keys and frequency) rather than (key and probability)?

@CSEACADEMY1 11 күн бұрын

Yes use it

@devpatel-hw2zk 2 ай бұрын

thankyou sir for sharing this trick ! grateful

@CSEACADEMY1 2 ай бұрын

Keep watching dear and subscribe our channel n also share ur friends

@SakshamKapoor-es1zm 3 ай бұрын

Initially no. of keys are 6 but in BST only 5 keys are taken key0 is lost?

@CSEACADEMY1 3 ай бұрын

Root node has fixed so (n-1) keys are required to construct OBST

@ahsanulhasib8554 7 ай бұрын

What about examples with only probability for successful search?

@CSEACADEMY1 7 ай бұрын

Because probability of successful search is help to build a binary search tree n it provide the way to search the key in minimum time

@CSEACADEMY1 7 ай бұрын

Thank u so much for ur comment please subscribe to channel for more videos

@aadeshlawande346 Ай бұрын

is this trick applicable for 3x3 matrix problem ?

@CSEACADEMY1 Ай бұрын

Yes

@vishalgavali476 2 ай бұрын

SIRF last ki tree nhi smji...baki expalnation NICE

@CSEACADEMY1 2 ай бұрын

Thanks, for Tree watch part 2

@nagpurkaengineer 8 ай бұрын

❤❤❤❤