You are required to write two seperate programs. Programs will read all information from a text file named “[url removed, login to view]”. Programs will only read the file, they will not write to the file. There will be no user interface. Binary Search Tree should be built by order of Magnitude, and it is allowed to have identical magnitude values.
Program1: Implement a Binary Search Tree by using Array.
Program2: Implement a Binary Search Tree by using Linked List.
For detail information about this project please check the attached pdf file .