+1 vote
in Data Structures & Algorithms I by (88.2k points)
Each level in a k-d tree is made of?

(a) dimension only

(b) cutting and dimension

(c) color code of node

(d) size of the level

I'd like to ask this question from Trees topic in section Trees of Data Structures & Algorithms I

I got this question by my college professor while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct option is (b) cutting and dimension

Explanation: Each level in a k-d tree is made of dimensions and cutting. Cutting and dimensions are used for insertion, deletion and searching purposes.

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.