+1 vote
in Data Structures & Algorithms I by (88.2k points)
In a two-dimensional search tree, the root is arbitrarily chosen to be?

(a) even

(b) odd

(c) depends on subtrees

(d) 1

My question is based upon Trees in division Trees of Data Structures & Algorithms I

I got this question in an international level competition.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct answer is (b) odd

For explanation: In a two- dimensional k-d tree (i.e.) 2-d tree, the root is arbitrarily chosen to be an odd level and it applies to all 2-d trees.

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.