What is a B-Tree?

One way to define B-Trees, is saying that they are like Binary Search Trees but with more keys and more than two children per node, having as main properties the characteristic of being searching trees and self-balanced. Nowadays, B-Trees are the most popular data structure, presenting a great advantage in the access to data over the time processing it. So in this way, today they are mostly used in hard drives, using a hierarchical index to minimise the number of disk reads and improve the time accessing the information.

#b-tree #javascript