In a two-dimensional search tree, the root is arbitrarily chosen to be?
A. even
B. odd
C. depends on subtrees
D. 1
Answer: Option B
This Question Belongs to Data Structure >> Trees In Data Structures
Related Questions on Trees in Data Structures
A. Inorder
B. Preorder
C. Postorder
D. Level-order
Join The Discussion