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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -0,0 +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>