>perhaps less useful neither-ranked-nor-keyed access, wherein the trees are kind of a double-ended queue with just "edge access" For normal btrees this is abso

>perhaps less useful neither-ranked-nor-keyed access, wherein the trees are kind of a double-ended queue with just "edge access" For normal btrees this is absolutely true. For b+trees you will see this basically everywhere.