Algorithm and optimization of spatial search based on spatial search of the tree

52 p.
(Publication details not specified)."One of the main tasks of information systems is the search of needed information. It is important to be economical about the data presentation and, moreover, be effective with information search without wasting time and effort. In order to solve this key problem a number of different approaches were formed, one of them is search trees.
There are different types of search trees, and one of the major ones as well as the one our algorithm was based on is binary trees.
Binary tree is the tree with no more than two edges going from each vertex, including the root. In this case, each vertex(except for root) of the binary tree as an input edge has no more than one edge."