+1 vote
in Data Structures & Algorithms I by (88.2k points)
In a k-d tree, k originally meant?

(a) number of dimensions

(b) size of tree

(c) length of node

(d) weight of node

This key question is from Trees in portion Trees of Data Structures & Algorithms I

I got this question during an interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct answer is (a) number of dimensions

For explanation: Initially, 2-d trees were created. Then, 3-d trees, 4-trees etc., where k meant the number of dimensions.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...