Uses of trees in multi dimensions.
Answers
Answered by
0
Answer:
Answer:The multidimensional binary search tree (abbreviated k-d tree) is defined as a data structure for storing multikey records. Data structure k-d trees are implemented for several applications, for example, searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches).
Similar questions