This exercise is intended to demonstrate using an array to builda binary tree to be used as a binary search tree. Youwill build your binary tree using the computational strategydescribed in our text and class lectures. The maximum size of thearray should be defined to accommodate a binary tree of height5.
You will write a Java program that has at least one function:main. main will be the entry point/driver of your program. You mayisolate the functionality of your solution by creating additionalfunctions if you wish.
Two data files will beprovided. Lab3InputFile1.txt willcontain node records having two fields: the value of theparent node and
PayPal Gateway not configured
PayPal Gateway not configured