Introduction - If you have any usage issues, please Google them yourself
List any position of the elements to insert, and delete, find it is extremely fast, the list each node has three domain: precursor element pointer domain, data fields, the rear element pointer domain