// -----------------------------------------------------------------------------
BNode* BNode::get_left_sibling() // get the left-sibling node
{
BNode* node = NULL;
if (left_sibling_ != -1) { // left sibling node exist
node = new BNode(); // read left-sibling from disk
node->init_restore(btree_, left_sibling_);
}
return node;
}
// -----------------------------------------------------------------------------
BNode* BNode::get_right_sibling() // get the right-sibling node
{
BNode* node = NULL;
if (right_sibling_ != -1) { // right sibling node exist
node = new BNode(); // read right-sibling from disk
node->init_restore(btree_, right_sibling_);
}
return node;
}