void BinaryTree::PrintRec(const BinaryTreeNode* node)
{
if (node->left_ != NULL)
{
PrintRec(node->left_);
}
printf("%d,", node->value_);
if (node->right_ != NULL)
{
PrintRec(node->right_);
}
}
void ADTree3M :: PrintRec (ostream & ost, const ADTreeNode3M * node) const
{
if (node->data)
{
// ost << node->pi << ": ";
ost << node->nchilds << " childs, ";
for (int i = 0; i < 3; i++)
ost << node->data[i] << " ";
ost << endl;
}
if (node->left)
PrintRec (ost, node->left);
if (node->right)
PrintRec (ost, node->right);
}
void BinaryTree::Print()
{
if(root_ != NULL)
{
PrintRec(root_);
}
else
{
printf("");
}
}
void ADTree :: PrintRec (ostream & ost, const ADTreeNode * node) const
{
if (node->data)
{
ost << node->pi << ": ";
ost << node->nchilds << " childs, ";
for (int i = 0; i < dim; i++)
ost << node->data[i] << " ";
ost << endl;
}
if (node->left)
{
ost << "l ";
PrintRec (ost, node->left);
}
if (node->right)
{
ost << "r ";
PrintRec (ost, node->right);
}
}
void ADTree6F :: PrintRec (ostream & ost, const ADTreeNode6F * node) const
{
int i;
if (node->data)
{
ost << node->pi << ": ";
ost << node->nchilds << " childs, ";
for (i = 0; i < 6; i++)
ost << node->data[i] << " ";
ost << endl;
}
for (i = 0; i < 64; i++)
if (node->childs[i])
PrintRec (ost, node->childs[i]);
}
void ADTree3Div :: PrintRec (ostream & ost, const ADTreeNode3Div * node) const
{
if (node->data)
{
ost << node->pi << ": ";
ost << node->nchilds << " childs, ";
ost << " from " << node->minx << " - " << node->minx + node->dist*ADTN_DIV << " ";
for (int i = 0; i < 3; i++)
ost << node->data[i] << " ";
ost << endl;
}
int i;
for (i = 0; i < ADTN_DIV; i++)
if (node->childs[i])
PrintRec (ost, node->childs[i]);
}
