---

0Lway0: 2024-09-22 10:38:18
No matter the sequence to which subtree, the first example's output should be 1 3 2 8 6 4 3.

212050胡昱: 2021-10-19 16:22:51
So how can our program get Accepted?

GoldenPi: 2021-03-02 21:06:48
No matter the sequence to which subtree, the first example's output should be 1 3 2 8 6 4 3.

bxx_GoodGod: 2020-11-25 15:32:29
不用管那个捞什子“优先调整左子树”

zcw8887: 2020-11-08 15:25:51
There are some mistakes in this problem. Firstly, the problem requires 8<n<1000, but the given examples are n=7 and n=8. Secondly, according to the strategy of preferential adjustment to the left subtree, the first output should be 1 3 2 8 6 4 3, the last non-leaf node's left and right subnodes are reversed.

Post Your Comment