coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 11:36:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

38
leetcode-cn/problem (English)/二叉搜索树序列(English) [bst-sequences-lcci].html
View File

@@ -1,19 +1,19 @@
<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>
<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>