In a two-dimensional search tree, the root is arbitrarily chosen to be?

› Category: Questions › In a two-dimensional search tree, the root is arbitrarily chosen to be?
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

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.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 5 months ago

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.


Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40701

Related Posts