Classification
I will start with a classification of the data structures shown already in the book. The classification divides all structures into linear and non-linear ones.
A linear data structure means that each element can be logically adjacent to the following or the previous element. There are several data structures that follow this rule, such as arrays, lists, stacks, and queues. Of course, you should also take care of various subtypes of the mentioned data structures, such as four variants of a linked list, which is a subtype of a list.
A non-linear data structure indicates that a single element can be logically adjacent to numerous others, not necessarily only one or two. They can be freely distributed throughout the memory. Of course, graph-based data structures, including trees, are included in this group. Trees include binary trees, tries, and heaps, while a binary search tree is a subtype of a binary tree. In a similar way, you can describe the relationships of...
