I need several data files for this [login to view URL] contains a number of words and acronyms ,one on each [login to view URL] may assume that none is more than 30 characters [login to view URL] words have been chosen at random from the UNIX dictionary. 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 a [login to view URL] file will be called SORTED.DAT. 3)Calculate the depth of the tree i.e how many levels the tree has.(root=level0). 4)Using a tree built(from previous assignment..)read the words from [login to view URL],look them up in the tree and re[ort whether each word is present in or absent from the tree. 5)Calculate the number of comparisons required during this operation for Successful(present) and Un successful(absent)searches and produce a table with 4 columns.1st column has a)successful b)unsuccessful c)overall.2nd column has [login to view URL] words.3rd column has [login to view URL] comparisons required and 4th column has average [login to view URL] comparisons per word. 6)Now create a binary tree by reading the data in [login to view URL] and repeat steps 3-5. 7)Finish the assignment by appending to your exercise a short section (one or two paragraphs)summarising the results and stating whe=at they show(as a comment in the program). 8)Repeat the recommended level, but using an AVL tree instead of a standard binary search tree.
## 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
In delphi.