Maximum depth of a B-tree
        Posted  
        
            by Phenom
        on Stack Overflow
        
        See other posts from Stack Overflow
        
            or by Phenom
        
        
        
        Published on 2010-04-05T22:17:06Z
        Indexed on 
            2010/04/05
            22:23 UTC
        
        
        Read the original article
        Hit count: 355
        
b-tree
How do you figure out the maximum depth of a B-tree?
Say you had a B-tree of order 1625, meaning each node has 1625 pointers and 1624 elements.
What is the maximum depth of the tree if it contains 85,000,000 keys?
© Stack Overflow or respective owner