_{[0230 - Kth Smallest Element In a Bst](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)} | _{<div align='center'>[✔️](c%2F0230-kth-smallest-element-in-a-bst.c)</div>} | _{<div align='center'>[✔️](cpp%2F0230-kth-smallest-element-in-a-bst.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F0230-kth-smallest-element-in-a-bst.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0230-kth-smallest-element-in-a-bst.go)</div>} | _{<div align='center'>[✔️](java%2F0230-kth-smallest-element-in-a-bst.java)</div>} | _{<div align='center'>[✔️](javascript%2F0230-kth-smallest-element-in-a-bst.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0230-kth-smallest-element-in-a-bst.kt)</div>} | _{<div align='center'>[✔️](python%2F0230-kth-smallest-element-in-a-bst.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](rust%2F0230-kth-smallest-element-in-a-bst.rs)</div>} | _{<div align='center'>[✔️](scala%2F0230-kth-smallest-element-in-a-bst.scala)</div>} | _{<div align='center'>[✔️](swift%2F0230-kth-smallest-element-in-a-bst.swift)</div>} | _{<div align='center'>[✔️](typescript%2F0230-kth-smallest-element-in-a-bst.ts)</div>}

_{[0105 - Construct Binary Tree From Preorder And Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)} | _{<div align='center'>[✔️](c%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.c)</div>} | _{<div align='center'>[✔️](cpp%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.go)</div>} | _{<div align='center'>[✔️](java%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.java)</div>} | _{<div align='center'>[✔️](javascript%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.kt)</div>} | _{<div align='center'>[✔️](python%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](typescript%2F0105-construct-binary-tree-from-preorder-and-inorder-traversal.ts)</div>}

_{[0096 - Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/)} | _{<divalign='center'>[✔️](c%2F0096-unique-binary-search-trees.c)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0096-unique-binary-search-trees.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0096-unique-binary-search-trees.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0095 - Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0095-unique-binary-search-trees-ii.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0095 - Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0095-unique-binary-search-trees-ii.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0095-unique-binary-search-trees-ii.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0129 - Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)} | _{<divalign='center'>[✔️](c%2F0129-sum-root-to-leaf-numbers.c)</div>} | _{<divalign='center'>[✔️](cpp%2F0129-sum-root-to-leaf-numbers.cpp)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0129-sum-root-to-leaf-numbers.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0129-sum-root-to-leaf-numbers.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0337 - House Robber III](https://leetcode.com/problems/house-robber-iii/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0337-house-robber-iii.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0337-house-robber-iii.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[0951 - Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0951-flip-equivalent-binary-trees.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0951-flip-equivalent-binary-trees.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

classSolution {

publicList<TreeNode>generateTrees(intn) {

returngenerate(1,n);

}

privateList<TreeNode>generate(intleft,intright) {

if (left >right) {

List<TreeNode>r =newArrayList<>();

r.add(null);

returnr;

}

List<TreeNode>res =newArrayList<>();

for (intval =left;val <=right;val++) {

for (TreeNodeleftSubtree :generate(left,val -1)) {

for (TreeNoderightSubtree:generate(val +1,right)) {

TreeNoderoot =newTreeNode(val);

root.left =leftSubtree;

root.right =rightSubtree;

res.add(root);

}

}

}

returnres;

}

}