Given that the pushing sequence of a stack is { 1, 2, $$\cdots$$

Given that the pushing sequence of a stack is { 1, 2, $$\cdots$$, $$n$$ } and popping sequence is { $$x_1, x_2, \cdots, x_n$$ }. If $$x_2 = n$$, we can obtain $$n-1$$ different possible popping sequences. ~@[](2)

答案：TRUE