DP Table Construction for Optimal BST

Keys: [10, 12, 20]
Frequencies: [34, 8, 50]
Welcome to the DP Table Construction visualization for Optimal Binary Search Tree. We'll see how to build a dynamic programming table to find the optimal cost of a BST for given keys and their frequencies.
Step 0: Initial Table