Leetcode 95. Unique Binary Search Trees II

Input: n = 3
Output: [[1,null,2,null,3],[1,null,3,2],[2,1,3],[3,1,null,null,2],[3,2,null,1]]
Input: n = 1
Output: [[1]]

--

--

--

CS new grad, 6 years experience related to supply chain management. Located in Bay area

Love podcasts or audiobooks? Learn on the go with our new app.

4 Key Takeaways from the Gartner Magic Quadrant for Data Integration Tools

Oracle Jre 7 Mac Download

Loops and Operators in Python.

Meet Ted: Mechanical Engineer Turned Software Developer

Metals Spot Wedigt For Mac Os X Dashboard

What is the right amount of Reflection in Golang?

Tutorial — Azure Functions via Linux Containers

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Gary Chiang

Gary Chiang

CS new grad, 6 years experience related to supply chain management. Located in Bay area

More from Medium

Leetcode 142. Linked List Cycle II

Leetcode Q166. Fraction to Recurring Decimal (Q160)

Binary Tree (DFS application)

Inheritance Quiz