Algorithms for k-d trees Bulk-loading takes time Insertion takes time Deletion involves nding "suitable" dimensional value from subtree   Since subtrees are ordered on other dimensions, this reduces to an exhaustive search. search time for point queries search time for range queries where is size of the answer set Partial range searching time for s dimensions is