Wow thanks for reading my page and looking at the examples. I appreciate your time. There's a few bugs in that code. Sorry for presenting something that obviou

Wow thanks for reading my page and looking at the examples. I appreciate your time. There's a few bugs in that code. Sorry for presenting something that obviously wasn't ready. I didn't use location when I insert into that position in the btree. And the node spliting code has an error. And thanks for reformatting the code. It's a very rough design. The critical insight over many algorithms is hidden in one character or line. Such as a strategic -1 or +1 or pattern of recursion that means it becomes understandable. I find when writing code the structure of the code is more important than the calculation or addition or subtraction. Which is surprising because computers are calculators. The structure of traversal, laying out data in memory and structure of the jumping around instructions in memory is harder than the core insight of a division, or subtraction or addition or append or +1 or if statement here or there. When I write recursive code I often want to refer to outer context of an outer recursion. So that's the meaning of the "deepest"