Question 1

You are provided a binary search tree with integers. Each node has three primary members: an Integer (which it holds), a pointer to its left child, and a pointer to its members: an Integer (which it holds), a pointer to its left child, and a pointer to its right child.

A function stub is provided in multiple languages. You need to complete so this function so that it will search for the presence of a specified integer in this tree. If the element (val ) is found, return 1. Otherwise return 0.

Each function stub will have its prototype, and an explanation of the data types or classes involved. The section of the program which parses the input and displays the output is complete in each language and will not need to be modified. Your task is to complete the body of the function provided so it returns the correct output.