> The particular problem of sequential keys is unfortunate, but hardly > catastrophic. The BTree uses twice as much space as it would under > ideal conditions. Twice as much disk space, yes. Disk space isnt the problem. An unbalanced tree will use *linear* memory and number-of-comparisons for= a=20 lookup. That defeats the main selling point of a BTree.