Greater sum tree

Given a binary search tree encoded as a level-order array (null for missing), convert it to a Greater Sum Tree where every node's new value is its original value plus the sum of all original values strictly greater than it. Return the result as a level-order array using the SAME shape as the input (null in the same positions), i.e. replace each non-null entry with its transformed value.