递归的方法
TreeNode* insertIntoMaxTree(TreeNode* root, int val) {
if(root == nullptr) return nullptr;
TreeNode* ret = new TreeNode(val);
if(val > root->val) {
ret->left = root;
return ret;
} else if(root->right == nullptr) {
root->right = ret;
} else if(root->right != nullptr) {
root->right = insertIntoMaxTree(root->right, val);
} else if(root->left == nullptr) {
root->left = ret;
} else if(root->left != nullptr) {
root->left = insertIntoMaxTree(root->left, val);
}
return root;
}