| 摘要 |
<p>There is provided a tree-type data structure expression method capable of effectively tracing a relationship such as parent-child, ancestor-descendant, brothers and sisters, and generations. A memory contains data of tree-type data structure expressed by a C-P arrangement in which a node identifier unique to a node is given and which has a pair of a node identifier given to each of non-route nodes whose parent-child relationship is other than the route node and a node identifier of a parent node correlated to each of the non-route nodes; and an apex node list containing node identifiers of particular nodes as apex nodes for expressing one or more node groups, each containing a particular node and a node of its descendant. A system (10) references the C-P arrangement and moves each of the apex nodes to a child node, a parent node, or a node of the same generation as the parent node or the apex node (elder brother node or younger brother node) so as to generate a new apex node list.</p> |
