I have a question regarding the b-tree.
For a binary tree, i usually declare a node like:
For a b-tree with a four key reference, it might look like:
So, would i declare a node like:
[D][T][ ][ ]
[A][C][D][ ] [S][T][ ][ ]
So, it's like a binary tree, except with more values and pointers. Is this the proper way to do this?