How is the feasibility of employing sequential storage structure for generalized list? Previously when we discussed storage of trees, we used sequential storage. This is because it is only a regular...

How is the feasibility of employing sequential storage structure for generalized list?

Previously when we discussed storage of trees, we used sequential storage. This is because it is only a regular and singular nonlinear structure, that is, each node does not contain any substructure. On the contrary, elements in a generalized list can still contain substructures. This enables the neighboring relations to be either linear or nonlinear. Also, in a generalized list, it is usually the case that linear and nonlinear structures exist at the same time. We may use sequential structure to represent its exceptional cases (e.g., pure list and linear list), but it is very difficult to use it as a general storage mechanism for generalized list.