Solve some of the problems of linked list

Current data structures have some problems that the purpose of this paper is to resolve some of these problems. One of these problems is the include lack of random access or the need for additional space for pointers in the linked list. To solve these problems we propose the GDS (Graphical Data Structures) matrix. This matrix is actually another way to implement the linked list. One of the features of GDS matrix is that it can store any data the way it is. For example we implement the binary tree using the linked list but in the GDS matrix we implement the tree as it is drown on the paper (This example is illustrated in the results)