self doubt

Question

For range queries every B+ tree index requires less I/O than a full table scan.

can anyone explain?

Comments

We can to leaf node from where our range begins. Then with each block access (remember leaf has pointer to next leaf in B+ tree) we can handle the range queries. So we don't have to scan entire table.