A JAVA method that searches a range of values in a binary search tree?

Question

Pseudocode in JAVA will be fine... for a method that performs a range query for a binary search tree.

That is, the method should visit all items that have a search key within a given range of values. For example, all values between 100 and 1000.

Answer 1

void search (Collection result, Constraints c, Node n ) {

if (n.left()!=null) {
search (result,c,n.left());
}

if (n.right()!=null) {
search (result,c,n.right());
}

if (this.isOk(c)) {
result.add(this);
}

}

this algorith visits recursively all nodes, it doesnt assume any ordering on the nodes except that it is a binary tree.

isOk(c) should return true if the node satisfies the constraints you want for the nodes.

results are collected in results.