C++
![Use the following code to answer the questions on this page.<br>void print(int arr[], int size, int curNode) { int main(){<br>int leftChild, rightChild;<br>leftChild = curNode * 2 + 1;<br>rightChild = curNode * 2 + 2;<br>int arr[7]<br>{3, 5, 1, 7, 6, 4, 2};<br>print(arr, 7, 0);<br>if (leftChild >= size) {<br>return;<br>return 0;<br>print(arr, size, leftChild);<br>Example invocation list if it takes 3 recursive<br>calls to complete and return to main. This is<br>an example to show the ordered list, it is not<br>print(arr, size, rightChild);<br>for the above code.<br>cout « arr[curNode] <«<br>e: print(arr, 24, 0)<br>1: print(arr, 24, 23)<br>2: print(arr, 24, 34)<br>3: print(arr, 24, 47)<br>return;<br>Q: (TOP RIGHT) Write a list, similar to above, containing all the function invocations performed by the given code.<br>The number preceding the function call is the order of invocation. Use literal numbers for the third argument.<br>0: print(arr, 7, 0)<br>Scratch notes can go in here or anywhere that isn't a solution box.<br>](https://s3.us-east-1.amazonaws.com/storage.unifolks.com/qimg-008/008_j8bnxz0-fl5twlbl.png)
Extracted text: Use the following code to answer the questions on this page. void print(int arr[], int size, int curNode) { int main(){ int leftChild, rightChild; leftChild = curNode * 2 + 1; rightChild = curNode * 2 + 2; int arr[7] {3, 5, 1, 7, 6, 4, 2}; print(arr, 7, 0); if (leftChild >= size) { return; return 0; print(arr, size, leftChild); Example invocation list if it takes 3 recursive calls to complete and return to main. This is an example to show the ordered list, it is not print(arr, size, rightChild); for the above code. cout « arr[curNode] <« e:="" print(arr,="" 24,="" 0)="" 1:="" print(arr,="" 24,="" 23)="" 2:="" print(arr,="" 24,="" 34)="" 3:="" print(arr,="" 24,="" 47)="" return;="" q:="" (top="" right)="" write="" a="" list,="" similar="" to="" above,="" containing="" all="" the="" function="" invocations="" performed="" by="" the="" given="" code.="" the="" number="" preceding="" the="" function="" call="" is="" the="" order="" of="" invocation.="" use="" literal="" numbers="" for="" the="" third="" argument.="" 0:="" print(arr,="" 7,="" 0)="" scratch="" notes="" can="" go="" in="" here="" or="" anywhere="" that="" isn't="" a="" solution="">