void BPlusTree::btree_inorder_print(btree_node *root) 
{
    if(NULL != root) {
        btree_inorder_print(root->p[0]);
        for(int i = 0; i < root->num; i++) {
            printf("%d ", root->k[i]);
          // 	fwrite(&root,sizeof(root),1,fp);
            btree_inorder_print(root->p[i+1]);
        }
    }
}
Esempio n. 2
0
void btree_inorder_print(btree_node *root)
{
    if(NULL != root)
    {
        btree_inorder_print(root->p[0]);
        for(int i = 0; i < root->num; i++)
        {
            printf("%d ", root->k[i]);
            btree_inorder_print(root->p[i+1]);
        }
    }
}