This paper proposes a data structure that uses the binary tree to organize multidimensional data. Based on the proposed data structure, an area search algorithm is proposed in order to find out all points in the given data set in the domain of given points. The search efficiency of the algorithm is not related with the space dimension. The average time complexity of the algorithm is O(logn). To guarantee the algorithm efficiency,the paper also proposes a balanced tree adjustment algorithm.%本文提出了一种使用二叉树组织多维数据的数据结构,在这种结构下提出了一个区域搜索算法,确定空间中给定点的区域内所有在给定数据集中的点,搜索效率与维数无关,算法的平均时间复杂性为O(logn),为了保证算法的效率,提出了一种平衡树操作算法.
展开▼
