Exercise 4 – Comparison of data structures
Download from this link a compressed file that contains threetext files.
Each file contains random words and they differ in terms of size(please check the size of each file before opening it).
Develop a program in C that, for each file:
• compares, for all the words in each file, the insertion timebetween a single linked list, a sorted linked list (inlexicographical order), a balanced binary tree, and a binary searchtree (in lexicographical order);
2 • compares the search time of multiple strings (pick randomstrings from the file) between the single linked list, the sortedlinked list, the balanced
OR
OR