2.2 Why DP is used for Optimal Binary Search Trees? | with example and intuition

In this video, we will understand that why dynamic programming is the best method to find the cost of an optimal binary search tree.
Timestamps:
0:00 Introduction
2:50 Why DP?
Tags:
#dp #optimalbst #optimalbinarysearchtree #datastructures #advanceddatastructures #timecomplexity #dsa #dynamicprogramming #cse

[@mayankbhatt1308]

bhai itna acha koi kaise padha sakta hai yr ❤💥💫...thanks a lot

[@uzairjavedakhtar3718]

Arre Thanks Bhai for the compliment..Means a lot😊🖤

[@sandeepkaleshriya]

MACT wale kuch bhi kar sakte he

[@unknownidentity154]

Sir your teaching skills are fabulous..will you also make videos on advance algo as well like optimization, approximation, randomisation algo etc.

[@swaimprabhadwivedi610]

🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰

[@uzairjavedakhtar3718]

Thanks A Lot 🖤