如何以特定格式C ++打印二进制搜索树

Question

I have to read data from the file and construct a binary search tree from the values in the order they are read. Thus; the first number read will be the root of the tree. I must attempt to store the numbers in an array. When I have read the last value into the BST, I need to conduct an in‐order traversal to output first 10 values in ascending order and Print them 10 to a line in a 5‐character wide field. .

My output is fine and printing all integers in ascending order but I want to print 10 integers in one line. I am stuck here. Can anybody help me figure this one out ?

My Code:

 struct Node
 {
    int key;
    Node *left, *right;
 };

 int NumNodes = 0;
 const int SIZE = 100;
 Node data[SIZE];

 Node* nNode(int value)
 {
    Node* temp = &data[NumNodes++];
    temp->key  = value;                  
    temp->left = temp->right = NULL; 
    return temp;
 }
      void inorder(Node *root)
{
if (root != NULL)
{
    inorder(root->left); 
    cout << root->key << setw(5) ;
    inorder(root->right);
}
Node* insert(Node* node, int key)
{
    if (node == NULL)
{
    return nNode(key);
}
if (key < node->key)
{
    node->left  = insert(node->left, key);
}
else if (key > node->key)
{
    node->right = insert(node->right, key);   
}
return node;
}

int main()
{
 int c,val,i=0;
string fileName;

Node *root = NULL;

ifstream infile;
cout << "Please enter the name of the file to open :";
cin >> fileName;                                                  // asks user to input filename
infile.open(fileName.c_str());                                    // opens file
if(!infile)
{
    cerr << "An eror occurred while openieng the file.";
    exit(1);
}

while(!infile.eof()){
    infile >> val;
    data[i].key = val;
    c=data[i].key; 

    root = insert(root, c);

    i++;        

}
infile.close();

inorder(root);


return 0;
}

Answer 1

void inorder(Node *root)
{
static int n=0;         
if (root != NULL)
{
    inorder(root->left);
    cout << setw(5) << root->key;  
    if(n%10==9)cout << endl;
    n++;
    inorder(root->right);

}
}