| 摘要 |
A new method of sorting and indexing data using a new data structure is introduced. The new data structure is a version of a binary search tree that provides indexing operations on complex data structures. The indexing is achieved by storing additional information on comparison of the keys in every node of a binary search tree. In most cases this information helps avoid repeated comparisons of the initial elements or completely excludes comparison of keys. The new data structure permits rotations and deleting of its nodes using methods of restoring the structure before, during or after the operations
|
