Binary Heap Test

1. What is the worst case of finding the nearest neighbour?

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

3. What is the run time of finding the nearest neighbour in a k-d tree?

4. The 2d search tree has the simple property that branching on odd levels is done with respect to the first key.

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

6. What will be the correct sequence of insertion for the following k-d tree?

7. In a k-d tree, k originally meant?

8. Reducing search space by eliminating irrelevant trees is known as?

9. Several kinds of queries are possible on a k-d called as?

10. Which of the following is the simplest data structure that supports range searching?