#include <iostream>

using namespace std;

class Tree //Add to this class to solve the task
{
public:
    void add(int value)
    {
        if (root == nullptr)
        {
            root = Node{value, nullptr, nullptr};
        }
        else
        {
            recursive_add(value, root);
        }
    }


    void recursive_add(int value, /* Node */ node)
    {
        if (value < node->value)
        {
            if (node->left == nullptr)
            {
                node->left = Node{value, nullptr, nullptr};
            }
            else
            {
                recursive_add(value, node->left);
            }
        }
        else
        {
            if (node->right == nullptr)
            {
                node->right = Node{value, nullptr, nullptr};
            }
            else
            {
                recursive_add(value, node->right);
            }
        }
    }

};

int main()
{
    Tree t1;
    t1.add(3);
    t1.add(5);
    t1.add(2);
    cout << "t1: ";
    t1.print();

    Tree t2;
    t2 = move(t1);
    t2.add(1);
    cout << "t2: ";
    t2.print();
	    
}