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.

Propagating events on iOS

Getting the weather — a full stack ReactJS/Python Flask API tutorial — Part 2

The Secret Sauce for Learning to Code Full-Time

How to build your Spring Boot as deb in maven

Portable Visual Studio Code for Python and C++ Development on External Hard Drive (Windows)

How to load custom JSON files into Laravel’s config

CS 373 Spring 2022: Blog #8

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

Knight Probability in Chessboard Solution | LeetCode-688: Medium | JavaScript Implementation

Leetcode Solutions

Leetcode 142. Linked List Cycle II

Count Binary Substrings