Scribd
Upload
127 views1 page

Exercise of Optimal Binary Search Tree Using Dynamic Programming

This document discusses constructing an optimal binary search tree using dynamic programming. It provides the key values and frequencies for 6 nodes, asking the reader to determine the cost of the optimal binary search tree for those values.

Uploaded by

sadia abbas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
127 views1 page

Exercise of Optimal Binary Search Tree Using Dynamic Programming

This document discusses constructing an optimal binary search tree using dynamic programming. It provides the key values and frequencies for 6 nodes, asking the reader to determine the cost of the optimal binary search tree for those values.

Uploaded by

sadia abbas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Exercise

Construct optimal binary search tree using dynamic programming also


construct optimal BST
Question-1

Question-2

Ans=142

Question-3

Node Number 0 1 2 3 4 5
Key -5 1 8 7 13 21
Frequency 4 1 2 1 8 16

You might also like