Dsa
Binary Search Tree
Hard
Balanced BST Reorganization
Given a binary search tree defined by a set of integers, reorganize it to create a balanced binary search tree. The input is a list of integers where each integer appears exactly once. The output should be the in-order traversal of the balanced BST as a space-separated string of integers.
Example Input:
5 2 8 1 3 7 9
Example Output:
1 2 3 5 7 8 9
Key concepts
binary_search_treetree_balancingdepth-first_search
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now