add leetcode problem-cn part2

算法题（国内版）/problem (English)/二叉搜索树序列(English) [bst-sequences-lcci].html

@@ -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>