void Insert(T x)
    {
        Node<T> *currentNode = root;

        if (root == nullptr){
            root = new Node<T>();
            root->value = x;
            return;
        }

        while (currentNode != nullptr)
        {
            if (x == currentNode->value)
                return;
            else if (x > currentNode->value)
            {
                /*if (currentNode->Bigger != nullptr)
                    currentNode = currentNode->Bigger;
                else
                    newNode = currentNode->Bigger;*/

                if (currentNode->Bigger == nullptr)
                {
                    currentNode->Bigger = new Node<T>;
                    currentNode->Bigger->value = x;
                }
                else
                {
                    currentNode = currentNode->Bigger;
                }
            }
            else
            {
                /*if (currentNode->Smaller != nullptr)
                    currentNode = currentNode->Smaller;
                else
                    newNode = currentNode->Smaller;*/

                if (currentNode->Smaller == nullptr)
                {
                    currentNode->Smaller = new Node<T>;
                    currentNode->Smaller->value = x;
                }
                else
                {
                    currentNode = currentNode->Smaller;
                }
            }
        }
    }