1130. Minimum Cost Tree From Leaf Values

Given an array arr of positive integers, consider all binary trees such that: - Each node has either 0 or 2 children; - The values of arr correspond to the values of each leaf in an in-order traversal of the tree. - The value of each non-leaf node is equal to the product of the largest leaf value in its left and right subtree, respectively. Among all possible binary trees considered, return th