Linked data structures combine a variety of most effective data structures used in a large number of algorithms. Any linked data structure represents a data structure which organized as a set of elements with links of each to other. Unlike one-dimensional array, in which all its elements are located in memory next to each other, in a linked data structure elements may be located in different memory locations. On the basis of linked data structures can be created new combined and modified data structures. Usage of linked data structures provides an increase in speed of insertion and deletion of elements compared with linear arrays of data. Among the most common effective simple data structures organized as linked data structures, we can select lists, stacks and queues that are the subject of this chapter. In the chapter is given a detailed realization of a linked list using the object-oriented programming language C++. In this chapter also is proposed a modified linked data structure – a multilevel linked data structure which is represented in a form of a set of recursively embedded each to other linear linked lists. The efficiency of a practical application of this data structure is shown on an example of solving of the NP-completed orthogonal packing problem.