private final Tree linkDown(int a_level){
if(i_current < i_size){
i_current++;
if(a_level < i_levels) {
Tree preceding = linkDown(a_level + 1);
Tree node = (Tree)i_template.read(i_bytes);
node._preceding = preceding;
node._subsequent = linkDown(a_level + 1);
node.calculateSize();
return node;
}
return (Tree)i_template.read(i_bytes);
}
return null;