# 09.02.2026 [1382. Balance a Binary Search Tree] скачать в хорошем качестве

# 09.02.2026 [1382. Balance a Binary Search Tree]

09.02.2026 [1382. Balance a Binary Search Tree](https://leetcode.com/problems/balance...) medium [blog post](https://leetcode.com/problems/balance...) [substack](https://open.substack.com/pub/dmitrii...) [youtube](   • # 09.02.2026 [1382. Balance a Binary Searc...  )  #### Join me on Telegram https://t.me/leetcode_daily_unstoppab... #### Problem TLDR Balance binary search tree #medium #dfs #### Intuition Collect to a list with in-order dfs. Build a new, count of left subtree is equal to the count of right subtree. Mid is current. #### Approach we can store nodes itself on a list we can avoid building the list, just make a lazy iterator (sequence in Kotlin, or Stack and from_fn in Rust) #### Complexity Time complexity: $$O(n)$$ Space complexity: $$O(n)$$, O(log(n)) for the lazy iterator #### Code https://dmitrysamoylenko.com/2023/07/...