Construct an AVL tree. For each line of the database and for each recognition sequence in that line, you will create a new SequenceMap object that contains the recognition sequence as its recognition_sequence_ and the enzyme acronym as the only string of its enzyme_acronyms_ main function

Explanation:

AVL trees are used frequently for quick searching as searching takes O(Log n) because tree is balanced. Where as insertion and deletions are comparatively more tedious and slower as at every insertion and deletion, it requires re-balancing. Hence, AVL trees are preferred for application, which are search intensive.

The attached diagramm further ilustrate this

answervisible;