C++로 이진트리를 만들고 있는데 막혔습니다.....

#include <iostream>
#include <vector>
using namespace std;
 
 
 
template <typename T>
class Node{
public:
    T data;
    Node * _Right;
    Node * _Left;
    static vector<Node<T>> v;
 
    Node() {}
    Node(T n) {
        this->data = n;
        this->_Right = NULL;
        this->_Left = NULL;
        v.push_back(this);
    }
};
 
template <typename T>
class tree {
public:
    void insert(T n);
};
 
template <typename T>
void tree<T>::insert(T n) {
    Node<T> * node = new Node<T>(n);
 
    while (1) {
        for (int i = 0; i < node->v.size(); i++) {
            if (node->v[i]._Left == NULL) {
                node->v[i + 1].push_back(node);
                node->v[i]._Left = node;
                return;
            }
            else if (node->v[i]._Right == NULL) {
                node->v[i + 1].push_back(node);
                node->v[i]._Right = node;
                return;
            }
        }
    }
}
 
int main(void) {
    tree<char> t;
 
    t.insert('A');
    t.insert('B');
    t.insert('C');
 
    return 0;
}