Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g1301_1400.s1382_balance_a_binary_search_tree.Solution

```
public class Solution
extends Object
```
1382 - Balance a Binary Search Tree.
Medium

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.

Example 1:

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

Output: [2,1,3,null,null,null,4]

Explanation: This is not the only correct answer, [3,1,4,null,2] is also correct.

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⁴].
- 1 <= Node.val <= 10⁵

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  TreeNode balanceBST(TreeNode root)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

balanceBST

public TreeNode balanceBST(TreeNode root)