Searching in B Tree

[Man4ish]

Can we search a value in B Tree which is less than or greater than a given value instead of searching the value. How?
Thanks in advance.

[weaknessforcats]

I assume you have Googled this already and found no help?

[Man4ish]

I assume you have Googled this already and found no help?

Yes I googled it but in the B tree only node that is present can only be searched , but i am trying to retrieve the node which has value less than or greater than a given node.

[weaknessforcats]

Then you have your answer: You can't search a B tree for a less-than value.

To do that, you need a sorted container. B trees are not sorted.

If you are using C++, create a vector and sort it. Then you can search it for your less than values.

If you are using C, create an array and sort it.

[Man4ish]

Then you have your answer: You can't search a B tree for a less-than value.

To do that, you need a sorted container. B trees are not sorted.

If you are using C++, create a vector and sort it. Then you can search it for your less than values.

If you are using C, create an array and sort it.

Thank you very much for your answer