k-d tree

noun

A space-partitioning data structure for organizing points in a k-dimensional space, used in search algorithms etc.

Meanings

nounk-d tree (plural k-d trees)

plural k-d trees

  1. computingA space-partitioning data structure for organizing points in a k-dimensional space, used in search algorithms etc.

Origin

Short for k-dimensional tree.

Full word history & related roots →
Cite this entry
APA

k-d tree. (n.d.). In WatkinsX Dictionary. Retrieved November 2, 2026, from https://dictionary.watkinsx.com/word/k-d%20tree

MLA

“k-d tree.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/k-d%20tree. Accessed November 2, 2026.

Chicago

WatkinsX Dictionary, s.v. “k-d tree,” accessed November 2, 2026, https://dictionary.watkinsx.com/word/k-d%20tree.

Source: k-d tree on Wiktionary, CC BY-SA 4.0.