+1 vote
in Data Structures & Algorithms I by (88.2k points)
The 2d search tree has the simple property that branching on odd levels is done with respect to the first key.

(a) True

(b) False

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

This question was addressed to me during an online exam.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct answer is (a) True

To explain: Branching on odd levels is done with respect to the first key and branching on even levels is done with respect to the second key in a 2-d tree.

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

...