701.二叉搜索树中的插入操作 class Solution { public: TreeNode* insertIntoBST(TreeNode* root, int val) { if (root == nullptr) { TreeNode* node = new TreeNode(val); return node; } if (root->val < val) { root->right = insertIntoBST(root->...