[reiserfs-list] b-tree implementation

[Mahesh]

Hi

        I would like to know how the on disk balanced trees implementation in
ReiserFS works. I mean could someone please take some time out to explain
how searching is done within the on disk b-tree, insertion of new metatdata
entries and deletion etx, and that too so fast.

Thanka a ton
Regards
Mahesh
([EMAIL PROTECTED])