Design and Implementation of Multiple Linked Lists Sharing the same Memory

In some languages, because there is no pointer data type, so the single linked list is described by the use of the array. When there are multiple nodes of the same type list, these lists can share the same static linked list of memory, so it can mutually adjust the remaining places to reduce the overflow space. To solve practical problems, this paper is designed from the static linked list sharing the same storage space, the constructor, inserting operations, deleting operations, and it puts up forward a suggestion of its specific implementation and analyzes time complexity of algorithms and its significances.