LeetCoding Challenge Oct.6: Insert Into a Binary Search Tree

문제의 개요

생각

코드

class Solution {
    public TreeNode insertIntoBST(TreeNode root, int val) {
        if (root == null) {
            return new TreeNode(val);
        }

        insertRecursive(root, val);
        return root;
    }

    void insertRecursive(TreeNode node, int val) {
        if (val < node.val) {
            if (node.left != null) {
                insertRecursive(node.left, val);
            } else {
                node.left = new TreeNode(val);
            }
        } else {  // val > node.val
            if (node.right != null) {
                insertRecursive(node.right, val);
            } else {
                node.right = new TreeNode(val);
            }
        }
    }
}