STORAGE OF TREE IN NAVIGABLE TYPE

摘要

PURPOSE: To provide a technique which compactly expresses a tree data structure and navigates this compact expression. CONSTITUTION: This compact expression is a list. Each element of the list shows a tree node and the list is organized according to the preordered crossing of a tree. Each list element contains only a data dictionary entry index 303 for an item of a type which is shown by the node corresponding to the list element. This navigation technique helps finding the list element positions for a sub-slave and a master of a node corresponding to a given list element and also a list element position for an optional slave of the master in the case of a master node, and furthermore, functions by finding the list elements for a sub-tree. The number of slaves of a given node is decided by a numerical value function which takes the entry index 303 as its argument.