7. What must be the missing logic in place of missing lines for finding sum of nodes of binary tree in alternate levels? 1le.g:-consider -complete binary tree: -height-3, [1,2,3, 4,5,6,7]-answer must...

Correct and detailed answer will be Upvoted else downvoted

Extracted text: 7. What must be the missing logic in place of missing lines for finding sum of nodes of binary tree in alternate levels? 1le.g:-consider -complete binary tree: -height-3, [1,2,3, 4,5,6,7]-answer must be 23 n=power (2, height)-1; //assume input is height and a[i] contains tree elements for (i-1;i<=n;) present="" level="" is="" initialized="" to="" 1="" and="" sum="" is="" initialized="" to="" e="" for=""><=pow(2,currentlevel-1);j+) sum="sum+a[i];" i-i+1;="" missing="">