I mean, if you're asking how the octree works I can try to explain at least what I'm lead to believe it is.
In an oct tree, there are nodes or "branches" from the trunk of the tree, which is the game. Each of these branches have 8 twigs that branch out from them, without exception.
Imagine it like the following:
T| X Y Z D
R|_|__|__|__|_
U| BRICK ONE |
N| | | | |
K| R R R R
That's my beautiful diagram.
The branches X, Y, and Z would be the position of the brick.
R, R, R, and R are the rotational values of the brick.
D is probably the datablock ID of the brick. I'm not 100% sure that's what this slot is used for, but it would make sense.
Anyway, I'm about 90% sure that's how each branch is formatted on the oct tree. The oct tree itself is just a bunch of these nodes (branches, or bricks in application).
I could be completely wrong though. That's just my best guess.