Skip to content

Practice Balance a Binary Search Tree

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#1382
LeetCode Problem

Balance a Binary Search Tree

Divide and ConquerGreedyTreeDepth-First SearchBinary Search TreeBinary Tree

Problem Statement

Given the root of a binary search tree, return a balanced binary search tree with the same node values. If there is more than one answer, return any of them. A binary search tree is balanced if the depth of the two subtrees of every node never differs by more than 1.

Source: Balance a Binary Search Tree on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
root = [1,null,2,null,3,null,4,null,null]
Output
[2,1,3,null,null,null,4]

# Example 2

Input
root = [2,1,3]
Output
[2,1,3]

Constraints

The number of nodes in the tree is in the range [1, 10^4].
1 <= Node.val <= 10^5

Related LeetCode Problems

Practice more problems similar to Balance a Binary Search Tree.

98 Validate Binary Search Tree Medium99 Recover Binary Search Tree Medium94 Binary Tree Inorder Traversal Easy95 Unique Binary Search Trees II Medium96 Unique Binary Search Trees Medium
← Previous Design a Stack With Increment OperationNext → Maximum Performance of a Team

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free