When we write an unidirectional iterator class it will include the following col

Question

When we write an unidirectional iterator class it will include the following collection of operators ++, --, +=, =, !=, * , =, ==, != +, -, ",/==, !=, *, ++(pre), ++(post) The main disadvantage of a linked list compared to a dynamic array is that it is more difficult to program. that there are many more segmentation faults. the lost of random access. that the multiple lists become entwined in memory and data is easily lost. In order to have a separate implementation file for our template class we #include a template file at the bottom of the h file. we name the implementation file with a cc and #include the h at the top. we make sure to #include the template file in the application file. This is something that we can't do with template classes. They only have h files.

Explanation / Answer

14. The lost of random access

Random access is not allowed.we cannot do binary search with linked lists

15. We #include a .template file at the bottom of the .h file.

13. ++, --, +=, = !=, *

above are the operators used in unidirectional itretor type

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.