"content":"<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>\r\n\r\n<p><strong>Example:</strong><br />\r\nGiven the following tree:</p>\r\n\r\n<pre>\r\n 2\r\n / \\\r\n 1 3\r\n</pre>\r\n\r\n<p>Output:</p>\r\n\r\n<pre>\r\n[\r\n [2,1,3],\r\n [2,3,1]\r\n]\r\n</pre>\r\n",
"code":"/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode(int x) : val(x), left(NULL), right(NULL) {}\n * };\n */\nclass Solution {\npublic:\n vector<vector<int>> BSTSequences(TreeNode* root) {\n\n }\n};",
"__typename":"CodeSnippetNode"
},
{
"lang":"Java",
"langSlug":"java",
"code":"/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * int val;\n * TreeNode left;\n * TreeNode right;\n * TreeNode(int x) { val = x; }\n * }\n */\nclass Solution {\n public List<List<Integer>> BSTSequences(TreeNode root) {\n\n }\n}",
"__typename":"CodeSnippetNode"
},
{
"lang":"Python",
"langSlug":"python",
"code":"# Definition for a binary tree node.\n# class TreeNode(object):\n# def __init__(self, x):\n# self.val = x\n# self.left = None\n# self.right = None\n\nclass Solution(object):\n def BSTSequences(self, root):\n \"\"\"\n :type root: TreeNode\n :rtype: List[List[int]]\n \"\"\"",
"__typename":"CodeSnippetNode"
},
{
"lang":"Python3",
"langSlug":"python3",
"code":"# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, x):\n# self.val = x\n# self.left = None\n# self.right = None\n\nclass Solution:\n def BSTSequences(self, root: TreeNode) -> List[List[int]]:",
"__typename":"CodeSnippetNode"
},
{
"lang":"C",
"langSlug":"c",
"code":"/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * struct TreeNode *left;\n * struct TreeNode *right;\n * };\n */\n\n\n/**\n * Return an array of arrays of size *returnSize.\n * The sizes of the arrays are returned as *returnColumnSizes array.\n * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().\n */\nint** BSTSequences(struct TreeNode* root, int* returnSize, int** returnColumnSizes){\n\n}\n",
"__typename":"CodeSnippetNode"
},
{
"lang":"C#",
"langSlug":"csharp",
"code":"/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * public int val;\n * public TreeNode left;\n * public TreeNode right;\n * public TreeNode(int x) { val = x; }\n * }\n */\npublic class Solution {\n public IList<IList<int>> BSTSequences(TreeNode root) {\n\n }\n}",
"__typename":"CodeSnippetNode"
},
{
"lang":"JavaScript",
"langSlug":"javascript",
"code":"/**\n * Definition for a binary tree node.\n * function TreeNode(val) {\n * this.val = val;\n * this.left = this.right = null;\n * }\n */\n/**\n * @param {TreeNode} root\n * @return {number[][]}\n */\nvar BSTSequences = function(root) {\n\n};",
"__typename":"CodeSnippetNode"
},
{
"lang":"Ruby",
"langSlug":"ruby",
"code":"# Definition for a binary tree node.\n# class TreeNode\n# attr_accessor :val, :left, :right\n# def initialize(val)\n# @val = val\n# @left, @right = nil, nil\n# end\n# end\n\n# @param {TreeNode} root\n# @return {Integer[][]}\ndef bst_sequences(root)\n\nend",
"__typename":"CodeSnippetNode"
},
{
"lang":"Swift",
"langSlug":"swift",
"code":"/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * public var val: Int\n * public var left: TreeNode?\n * public var right: TreeNode?\n * public init(_ val: Int) {\n * self.val = val\n * self.left = nil\n * self.right = nil\n * }\n * }\n */\nclass Solution {\n func BSTSequences(_ root: TreeNode?) -> [[Int]] {\n\n }\n}",
"__typename":"CodeSnippetNode"
},
{
"lang":"Go",
"langSlug":"golang",
"code":"/**\n * Definition for a binary tree node.\n * type TreeNode struct {\n * Val int\n * Left *TreeNode\n * Right *TreeNode\n * }\n */\nfunc BSTSequences(root *TreeNode) [][]int {\n\n}",
"__typename":"CodeSnippetNode"
},
{
"lang":"Scala",
"langSlug":"scala",
"code":"/**\n * Definition for a binary tree node.\n * class TreeNode(var _value: Int) {\n * var value: Int = _value\n * var left: TreeNode = null\n * var right: TreeNode = null\n * }\n */\nobject Solution {\n def BSTSequences(root: TreeNode): List[List[Int]] = {\n\n }\n}",
"__typename":"CodeSnippetNode"
},
{
"lang":"Kotlin",
"langSlug":"kotlin",
"code":"/**\n * Example:\n * var ti = TreeNode(5)\n * var v = ti.`val`\n * Definition for a binary tree node.\n * class TreeNode(var `val`: Int) {\n * var left: TreeNode? = null\n * var right: TreeNode? = null\n * }\n */\nclass Solution {\n fun BSTSequences(root: TreeNode?): List<List<Int>> {\n\n }\n}",
