k-Dimensional Tree

An implementation of k-dimensional tree for storage, management (insert/search/delete) and range query for multi-dimensional numerical data.
Project done under supervision of Dr. Vishwanath Gunturi

Supported Operations

• Bulk loading from a text file
• Visualization of current tree
• Insertion
• Deleton
• Range Query

Initially, data is bulk-loaded from "Dataset.txt" that has ID, col1, col2 . . . . coln.
Then, insertion/deletion/visualization can be performed.
At each level, existing points are split into two parts along the dimension with maximum difference in two extreme points.
Each node stores the location of its split axis/ parent/ children along with data point.
Range Query involves finding points that lie inside rectangle whose two extreme ends are given as input.

Results of range query are as given in Observation Report