Convert an array [10, 26, 52, 76, 13, 8, 3, 33, 60, 42] array into a well-balanced binary search tree.

We are looking at a “sum-scan” (a scan with addition as the operator).sum-scan has two variants. in an “exclusive sum-scan”, the output at each data element isthe sum of all the input elements that came before that element. in an “inclusive sum-scan”,the output at each data element is the sum of all the input elements up to?