METHOD AND DEVICE FOR N-ARY TREE SEARCH

摘要

PROBLEM TO BE SOLVED: To provide a method and device for n-ary tree search which reduce the number of nodes to efficiently search a node. SOLUTION: A pointer is set to the least or most significant digit of a number expressed as an n-notation number and is moved toward upper or lower digits and is held at the digit where the number is not 0, and nodes of the n-ary tree corresponding to the digit at which the pointer is held are searched from the top (trunk) of the n-ary tree toward the bottom (branches) in order from the right/left branch; and when a corresponding node is found, all of right/ left nodes including this node which have the same parent are cut away, and a mark indicating unavailability is given to nodes of parents (ancestors) of cut-away nodes, and the processing is terminated when the pointer points the most or least significant digit.