Developing an Application for Manipulating Subtitles

In this phase, your goal is to speedup the access to the subtitles using a search tree. To this end, you will use a sorted map, which is a data structure that allows for search and traversal of the elements in increasing or decreasing order of the keys. A sorted map can be implemented as a BST with backward and forward links (basically it is a BST + DoubleLinkedList) (see an example in Figure 1).