If there are more than one elements , then recur for left and right subtrees and store the sum of values in this node
mid = ( ss + se ) // 2 ; NEW_LINE constructSTUtil ( arr , ss , mid , si * 2 + 1 ) ; NEW_LINE constructSTUtil ( arr , mid + 1 , se , si * 2 + 2 ) ; NEW_LINE tree [ si ] = max ( tree [ si * 2 + 1 ] , tree [ si * 2 + 2 ] ) ; NEW_LINE