Question

write a program to enumerate all possible parenthesizations for an increasing number of opening and matched closing brackets. Implement the dynamic programming for matrix chain multiplication

Answer 1

Kth smallest element in a binary a search tree. Given a binary search tree, find k th smallest element in the binary search tree. For example, 5th smallest element in below binary search.

Answer 2

Answer:

hope this answer useful to you mate