701. Insert Into A Binary Search Tree

You are given the root node of a binary search tree (BST) and a value to insert into the tree. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.

Notice 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.

class Solution:
    def insertIntoBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:
        def recurse(node):
            if node is None:
                return TreeNode(val)
            
            if node.val < val:
                node.right = recurse(node.right)
                return node
            else:
                node.left = recurse(node.left)
                return node
                
        return recurse(root)

• basic recursion, just remember that the new value is always inserted as a leaf.

table without id file.inlinks as Backlinks
where file.name = this.file.name

Related.

References.

Categories:: binary-search-tree, tree, recursion