Please enable JavaScript.

Coggle requires JavaScript to display documents.

B Trees Click here, eSTRUCTURA que sea capaz de gusradar datos leer datos…

- - - - red-black trees
        
        They can have many children.
    - - height is O log(n)
    - - minimizar la altura, mechanic.
        
        mainly for hdd
      - filter information
      - Example of a Tree
        
        grade >= 2?
        maximum number of children
        
        minimum grade
        
        nodo interno x
        
        n+2 pointer
        
        node
        
        t -1 keys minimum
        
        2t -1 maximum
        
        Example t = 2
        minimum 1
        maximum 3
        
        a node is full when it has t -1 keys.
        
        root
        
        la raiz tambien puede ser una hoja if they do not have children.
        
        if the tree is not null, they root has at least 1 key.