力扣-701题二叉搜索树中的插入操作（C++）- 树

矫情吗；* 2022-09-01 00:55 141阅读 0赞

题目链接：[https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/][https_leetcode-cn.com_problems_insert-into-a-binary-search-tree]  
题目如下：  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQwNDY3Njcw_size_16_color_FFFFFF_t_70]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQwNDY3Njcw_size_16_color_FFFFFF_t_70 1]  
![在这里插入图片描述][602fe94892a941149529bb8f42a3048c.png]

/**
     * 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* insertIntoBST(TreeNode* root, int val) {
        
    
            if(!root){
        //空节点，即此位置该插入新节点
                TreeNode* node=new TreeNode(val);
                return node;
            }
    
            if(root->val>val) root->left=insertIntoBST(root->left,val);//和当前节点比较
            else root->right=insertIntoBST(root->right,val);
    
            return root;
        }
    };

[https_leetcode-cn.com_problems_insert-into-a-binary-search-tree]: https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQwNDY3Njcw_size_16_color_FFFFFF_t_70]: /images/20220829/99bd664438b246eeba134792c97723bf.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQwNDY3Njcw_size_16_color_FFFFFF_t_70 1]: /images/20220829/920259a9dc13492d908edaad43e511dc.png
[602fe94892a941149529bb8f42a3048c.png]: /images/20220829/f124896f4f9340b1b8846382025bfb56.png