I need a C code for this problem

Each node of a Binary Search Tree (BST) has an integer value and pointers to two children, referred to as left child and right child. The value of left child is always less than the value of its parent node, and the value of right child is always greater than or equal to the value of its parent node.

The isPresent function in your editor has two parameters: a reference to the root node of a Binary Search Tree (BST) and an integer value. Complete isPresent so it returns 1 if the value is present in the BST, and returns 0 otherwise. Constraints

1 < total nodes 105

1 Sample Input 0

20

10 30

8 12 25 40

Values

30

10

12

15

Sample Output 0

1

1

1

0