请帮忙找出数字打印中的错误。如果你只是输出一个数组，那么一切正常，但我添加了一个数字来插入，它在打印中消失了

#include <iostream>
#include<random>
using namespace std;


class Node {
    friend class tree;
    int data;
    Node* l = NULL;
    Node* r = NULL;
    Node* parent = NULL;
    
public:
    Node(int d) :data(d) {};

    int node_get_data() {
        return data;
    }
    Node* node_get_left() {
        return l;
    }
    Node* node_get_right() {
        return r;
    }
    void node_set_left(Node* n) {
        l = n;
    }
    void node_set_right(Node* n) {
        r = n;
    }
    void node_set_data(int n) {
        data = n;
    }
    void node_set_parent(Node* n) {
        parent = n;
    }


};

class tree {
    Node* root = NULL;
public:
    tree(Node* n, int size) {//constructor
        root = n;
        --size;
        insert(n+1, root, size);

    };

    tree(Node n) {// only root there
        root = &n;
    };

    Node* add_elem(Node n) {
        insert(n, root);
        return root;
    }

    Node insert(Node n,Node* current){
        if (root == NULL)
            root = &n;

        if (n.node_get_data() > current->node_get_data())
            if (current->node_get_right() == NULL)
            {
                current->node_set_right(&n);
                current->node_get_right()->node_set_parent(current);
            }
            else insert(n, current->node_get_right());

           
        else if (current->node_get_data() > n.node_get_data())
            if (current->node_get_left() == NULL)
            {
                current->node_set_left(&n);
                current->node_get_left()->node_set_parent(current);
            }
            else insert(n, current->node_get_left());

        return n;
    }

    Node* insert(Node* n, Node* current,int size)// for arrays 
    {

        static int c = 0;
       /*while*/ if (c != size) {
           
            if ((current->node_get_data()) < (n->node_get_data()))
                if (current->node_get_right() == NULL)
                {
                    current->node_set_right(n);
                    current->node_get_right()->node_set_parent(current);
                    ++c;
                    insert(n + 1, root,size);
                }
                else
                    insert(n, current->node_get_right(),size);

            else if (current->node_get_data() > n->node_get_data())
                if (current->node_get_left() == NULL)
                {
                    current->node_set_left(n);
                    current->node_get_left()->node_set_parent(current);
                    ++c;
                    insert(n + 1, root,size);
                }
                else
                    insert(n, current->node_get_left(),size);
        }
        return n;
    }



    void print() {
        printo(root);
    }

    void printo(Node* current) {
        if (current != NULL)
        {
            printo(current->node_get_left());
            cout << current->node_get_data()<<"\t";
            printo(current->node_get_right());
        }
       

    }

};



int main()
{
    Node n(7);
    Node n1(8);
    Node n2(10);
    Node n3(6);
    Node n4(5);
    Node n5(11);
    Node arr[5] = { n,n1,n2,n3,n4 };
   
    tree tr(arr,sizeof(arr)/sizeof(Node));
    tr.add_elem(n5);
    tr.print();

}