What will be the correct sequence of insertion for the following k-d tree?
A. (30,40),(5,25),(70,70),(10,12),(50,30),(35,45)
B. (40,30),(5,25),(12,10),(70,70),(30,50),(45,35)
C. (30,40),(5,25),(10,12),(70,70),(50,30),(35,45)
D. (40,30),(25,5),(12,10),(70,70),(50,30),(45,35)
Answer: Option C
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