[MIRROR] Data structures course 2024-2025 materials. https://git.syndamia.com/edu/FMI/Data-structures-and-algorithms/atom/Seminar05/src?h=upstream%2Fmain 2024-11-20T22:58:46Z 2024-11-20T22:58:46Z Hristo Partenov 146854527+ico12319@users.noreply.github.com 2024-11-20T22:58:46Z urn:sha1:9c60ee9f795138f85409ca302f5ee61a68746ee1 In the remove_after function, I added a check if (!it.currentElementPtr->next) because if we have a list with two elements and move an iterator to the end of the list, it will try to access to_delete->next, which would result in an error. This check also handles the case when the size is equal to 1. In the insert_after function, if we insert after the tail and then try to push_back another element, we might lose data. Therefore, if itNode == _tail, we should update _tail to point to the new node. 2024-11-12T22:20:20Z Stoycho Kyosev stoycho.kk@gmail.com 2024-11-12T22:20:20Z urn:sha1:ad40e20b8983831400502fa9617f4c842ae23b78