Home/ Questions/Q 8497691
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-11T00:11:54+00:00

Let us consider the following picture this is a so called range tree. I

  • 0

Let us consider the following picture
enter image description here

this is a so called range tree. I don’t understand one thing, it looks similar to a binary search tree, so if we are inserting elements, we can use the same procedure as during binary search tree insertion. So what is the difference?

I have read a tutorial and guess that it is a varation of kd trees, query search trees (like geometric point searching, and so on) but how to construct it? Like binary search tree or does it need additional parameters? Maybe like this

struct  range
{
int lowerbound;
int upperbound,
int element;

};

and during insertion we have to check 

 if(element>lowerbound && element <upperbound) 
then insert node

Please help me to understand correctly how to construct a range tree.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    In binary search tree when you insert a value you insert a new node.

    The range search tree is more similar to binary index tree. These two data structures have fixed structures. When you add / subtract a point to a given range you update the values in the nodes, but do not introduce new nodes.

    The construction of this structure is much similar to that of KD-tree: based on the given points you choose the most appropriate points of splitting.

    When you learn new data structure always consider the supported operations – this will help you understand the structure faster. In your case it would have helped you distinguish between binary search tree and range tree.

    • 0