Maximum Binary Tree II (C++ Maximum Binary Tree II)

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* insertIntoMaxTree(TreeNode* root, int val) {
        if(root && root->val>val) {
            root->right=insertIntoMaxTree(root->right,val);
            return root;
        }
        TreeNode *node = new TreeNode(val);
        node->left=root;
        return node;
    }
};