View source for C 0000006 mmmv btree folder structure t1


[[C 1..100]]

<span style="color: red;">This specification ended up to be FLAWED, because there might be less files than is needed to fulfill the [https://bitrary.softf1.com/index.php?title=Mathematics_:_Graph_Theory_:_Trees_:_B-trees B-tree] requirements. Please refer to the [[C_0000007 mmmv_btreelike_folder_structure_t1]] instead.</span>



The idea is that the nodes of a [https://bitrary.softf1.com/index.php?title=Mathematics_:_Graph_Theory_:_Trees_:_B-trees B-tree] are folders, folder names are keys, with the exception of folders named "root","leaf", and files have a key as their file name prefix, which is written as a base 10 positive whole number, including zero, followed by an underscore and the rest of the file name. The interpretation of the keys in non-leaf vertices is: "less than or equal to the key". <span style="color: red;">bla-bla-bla-bla</span>