The document discusses K-dimensional trees (K-D trees), which are a space-partitioning data structure used to organize multidimensional point data. K-D trees partition space by splitting along coordinate axes, with each node associated with a different dimension. Points are sorted in the tree based on whether their value for the split dimension is higher or lower than the node value. The tree allows for efficient searches within multidimensional search spaces.

1. Vivek Kantariya (09bce020) Guided by : Prof. Vibha Patel