Question

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.

Answer 1

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.