Efficient searching I: B-Trees

Ver programa


4.6 (56 calificaciones)

  • 5 stars
    67,85 %
  • 4 stars
    25 %
  • 3 stars
    5,35 %
  • 2 stars
    1,78 %


8 de may. de 2022

The course is really good and the course material is also amazing. I highly reccomend it provided you have an interest in this specialization.


28 de sep. de 2020

Really like the course. Though it's difficult and challenging, I managed to understand the concept. I will keep practicing.

De la lección

I/O-efficient data structures

In this module we introduce some I/O-efficient data structures: B-trees and buffer trees, and an I/O-efficient priority queue based on buffer trees.

Impartido por:

  • Placeholder

    Mark de Berg


Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.