[leetcode]701. Insert into a Binary Search Tree

[leetcode]701. Insert into a Binary Search Tree

---

Analysis

明天要吃柚子—— [每天刷题并不难0.0]

Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.
Note that there may exist multiple valid ways for the insertion, as long as the tree remains a BST after insertion. You can return any of them.
二叉树的插入问题，递归解决

Implement

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* insertIntoBST(TreeNode* root, int val) {
        TreeNode* in = new TreeNode(val);
        if(!root){
            root = in;
            return root;
        }
        helper(root, val);
        return root;
    }
    void helper(TreeNode* node, int val){
        if(node->val > val){
            if(!node->left){
                node->left = new TreeNode(val);
            }
            else
                helper(node->left, val);
        }
        else{
            if(!node->right){
                node->right = new TreeNode(val);
            }
            else
                helper(node->right, val);
        }
    }
};

增加一个迭代的做法，其实和递归本质上一模一样

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* insertIntoBST(TreeNode* root, int val) {
        TreeNode* in = new TreeNode(val);
        if(!root){
            root = in;
            return root;
        }
        TreeNode* node = root;
        TreeNode* node1 = NULL;
        while(node){
            node1 = node;
            if(node->val > val)
                node = node->left;
            else
                node = node->right;
        }
        if(node1->val > val)
            node1->left = new TreeNode(val);
        else
            node1->right = new TreeNode(val);
        return root;
    }
};