machendos / b-tree Goto Github PK

Since the tree will correspond to c ++, we probably need to change the storage structure of the elements in the nodes of the tree. And instead of an array do one / two-link list? Since when adding and searching an element, we still need to look at the whole array, but at the time of inserting into the middle it would be nicer not to touch the whole array, but to change only the links in the two nodes