two text files and trees
Hello i need to make a program already have my trees but have couple questions. hoping someone can help.
1. what is a parser?
2. do i need two vectors since i have 2 files less than 2mb
3. and then from there construct a binary search tree
Here's what i have to do:
You will create a parser to read in this database and construct a search 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 search key and the enzyme acronym in the set of strings and you will insert this object into the tree. In the case of a duplicate on insertion, the search tree will call the x.merge(SequenceMap other) function of the existing element, x, in the tree which will add the newly created other SequenceMap’s enzyme acronym to the set of enzyme acronyms contained by the SequenceMap in the tree.
1. what is a parser?
2. do i need two vectors since i have 2 files less than 2mb
3. and then from there construct a binary search tree
Here's what i have to do:
You will create a parser to read in this database and construct a search 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 search key and the enzyme acronym in the set of strings and you will insert this object into the tree. In the case of a duplicate on insertion, the search tree will call the x.merge(SequenceMap other) function of the existing element, x, in the tree which will add the newly created other SequenceMap’s enzyme acronym to the set of enzyme acronyms contained by the SequenceMap in the tree.
Topic archived. No new replies allowed.