LeetCode 701. 二叉搜索树中的插入操作

题目

题解

注意空树

代码

/**
 * 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==nullptr){
            TreeNode* node=new TreeNode(val);
            root=node;//root=new TreeNode(val);
            return root;
        }
        TreeNode* rt=root;
        while(rt!=nullptr){
            if(rt->val>val){
                if(rt->left==nullptr)
                {
                    TreeNode* node=new TreeNode(val);
                    rt->left=node;
                    return root;
                }
                else
                {
                    rt=rt->left;
                }       
            }
            else{
                if(rt->right==nullptr)
                {
                    TreeNode* node=new TreeNode(val);
                    rt->right=node;
                    return root;
                }
                else
                {
                    rt=rt->right;
                }
            }
        }
        return root;
    }
};