Insertion into a 2-d tree is a trivial extension of insertion into a binary search tree.

Category: QuestionsInsertion into a 2-d tree is a trivial extension of insertion into a binary search tree.
Editor">Editor Staff asked 1 month ago

Insertion into a 2-d tree is a trivial extension of insertion into a binary search tree.
 
(a) true
 
(b) false
 
Query is from Trees in portion Trees of Data Structures & Algorithms I
 
This question was addressed to me in an online interview.

1 Answers
Editor">Editor Staff answered 1 month ago

Correct answer is (a) true
 
Best explanation: Insertion of elements in a 2-d tree is similar to that of a binary search tree. Hence, it is a trivial extension of the binary search tree.