class Solution

{

public:

    TreeNode* insertIntoMaxTree(TreeNode* root, int val)

    {

        if(root == NULL)

        {

            root = new TreeNode(val);

            return root;

        }

        if(val > root->val)

        {

            TreeNode* temporary = root;

            root = new TreeNode(val);

            root->left = temporary;

            return root;

        }

        else

        {

            root->right = insertIntoMaxTree(root->right, val);

            return root;

        }

    }

};