The 2d search tree has the simple property that branching on odd levels is done with respect to the first key.

Category: QuestionsThe 2d search tree has the simple property that branching on odd levels is done with respect to the first key.
Editor">Editor Staff asked 1 month ago

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 Answers
Editor">Editor Staff answered 1 month ago

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.