Available question text
Given a BST, produce any height-balanced BST containing the same node values (a tree where the depths of left and right subtrees of every node differ by at most 1). Key idea: use an inorder traversal to get the sorted values and rebuild the tree with a divide-and-conquer (middle-element as root) to ensure balance.
Related questions
Continue with questions that share topics or the same question type.
- Binary Search Tree Iterator
Coding
- Binary Search Tree Iterator II
Coding
- Binary Search Tree to Greater Sum Tree
Coding · Binary Search Tree · Binary Tree · Depth-First Search
- Closest Binary Search Tree Value
Coding · Binary Search · Binary Search Tree · Binary Tree
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1382. Balance a Binary Search Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source