mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
20 lines
437 B
HTML
20 lines
437 B
HTML
<p>A binary search tree was created by traversing through an array from left to right and inserting each element. Given a binary search tree with distinct elements, print all possible arrays that could have led to this tree.</p>
|
|
|
|
|
|
|
|
<p><strong>Example:</strong><br />
|
|
|
|
Given the following tree:</p>
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
2
|
|
|
|
/ \
|
|
|
|
1 3
|
|
|
|
</pre>
|
|
|
|
|
|
|
|
<p>Output:</p>
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
[
|
|
|
|
[2,1,3],
|
|
|
|
[2,3,1]
|
|
|
|
]
|
|
|
|
</pre>
|
|
|