Insert Into A Binary Search Tree · Interview Problem

Back to problems

Leetcode

insert-into-a-binary-search-tree

Medium

Trees

Recursion

Binary Search Tree

Insert Into A Binary Search Tree

Insert a value into a Binary Search Tree and return the root after insertion.

Acceptance 100%

Start Practice Editorial

Also Available On

Other platform versions and source mappings for the same problem.

Insert into BST

gfg

Problem Statement

Core description from the backend problem record.

Description

Given the root node of a Binary Search Tree (BST) and a value to insert into the tree, insert the value into the BST and return the root node of the BST after insertion. It is guaranteed that the new value does not exist in the original BST. The insertion must maintain the properties of the BST.

Input Format

root: TreeNode, the root of the BST.
val: Integer, the value to be inserted into the BST.

Output Format

Return the root node of the BST after inserting the given value.

Constraints

The number of nodes in the tree will be in the range [0, 10^4].
-10^8 <= Node.val, val <= 10^8
All the values Node.val are unique.
val does not exist in the original BST.

Examples

Sample cases returned by the problem API.

Example 1

Input

root = [4,2,7,1,3], val = 5

Output

[4,2,7,1,3,5]

Explanation

After inserting 5, the tree should maintain the BST property with 5 as the left child of 7.

Loading Preptin

Description

Input Format

Output Format

Constraints