|
5 | 5 | importjava.util.ArrayList; |
6 | 6 | importjava.util.List; |
7 | 7 |
|
8 | | -/** |
9 | | - * 1382. Balance a Binary Search Tree |
10 | | - * |
11 | | - * Given a binary search tree, return a balanced binary search tree with the same node values. |
12 | | - * A binary search tree is balanced if and only if the depth of the two subtrees of every node never differ by more than 1. |
13 | | - * If there is more than one answer, return any of them. |
14 | | - * |
15 | | - * Example 1: |
16 | | - * Input: root = [1,null,2,null,3,null,4,null,null] |
17 | | - * Output: [2,1,3,null,null,null,4] |
18 | | - * Explanation: This is not the only correct answer, [3,1,4,null,2,null,null] is also correct. |
19 | | - * |
20 | | - * Constraints: |
21 | | - * The number of nodes in the tree is between 1 and 10^4. |
22 | | - * The tree nodes will have distinct values between 1 and 10^5. |
23 | | - * */ |
24 | 8 | publicclass_1382 { |
25 | 9 | publicstaticclassSolution1 { |
26 | 10 | publicTreeNodebalanceBST(TreeNoderoot) { |
|