Could this be done with the implement of single linked list?

1. Microproject is an implementation of a chosen data structure (single linked list / bidirectional list / binary search tree / priority queue) in the form of a class with a convenient programming interface, without the use of STL containers. . . Requirements: usage of smart pointers, default constructor, copy / move constructors, destructor, assignment/move operators, adding container elements, searching for an element, sorting content (different criteria), serialization / deserialization (reading and writing from byte stream). . . implementation of an iterator that will allow the use of STL algorithms for the class, implementation of the entire class as a template. 2. The project should be divided into appropriate .cpp and .h files. 3. The class and all its methods should be tested (add tests to the main function in your project, together with related comments). Also, check for memory leaks. 4. Prepare files with example data (text file with a large amount of data, which will be kept in the created container, and a file in binary format with some deserialized data that can be read)