Data, Data Engineering, Algorithms, Data Structures, Interview.
height-balanced m-way tree. It is a modified BST, where a node can have more than 1 key and can have more than two children. It maintains sorted data. All leaf nodes are at the same level. In a real-life system, each node is the size of a disk page. The total size of the keys, values and pointers