Binary tree

Data: See the courses website for several data files for this assignment. Each contains a number of words and acronyms, one on each line. You may assume that none is more than 30 characters long. The words have been chosen at random from the UNIX dictionary. Task: 1: Build a binary tree of the data in any of the files. 2: Offer the facility to display the data (at user's choice) in lexicographic or reverse lexicographic order on screen or in the file. The file will be called [login to view URL] 3: Calculate the depth of the tree i.e. how many levels the tree has. (root=level 0). 4: Using the tree built in task 1,read the words from [login to view URL], look them up in the tree, and report whether each word is present in or absent from the tree. 5: Calculate the number of comparisons required during this operation for Succesesful (present) and Unsuccessful (absent) searches and produce a table in the following format: (1)No. of words (2)No. of comparisons required (3)Average no. of comparisons per word Successful: Unsuccessful: Overall: 6: Now create a binary tree by reading the data in [login to view URL] and repeat step 3-5. 7: Finish the assignment by qppending to your exercise a short section (one or two paragraphs) summarising the results and stating what they show (as a comment in the program). ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased. ## Platform You need to use the Delphi 6 personal edition with Pascal and you need to create the binary tree with pointers.