Leetcode Problem 701. Insert into a Binary Search Tree

701. Insert into a Binary Search Tree

Leetcode Solutions

Start at the root node.
If the root is null, create a new node with the given value and return it.
If the value to be inserted is less than the current node's value, recursively call the insert function on the left child.
If the value to be inserted is greater than the current node's value, recursively call the insert function on the right child.
Return the current node after performing the insertion in the subtree.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen