LeetCode : 96. Unique Binary Search Trees

• 96. Unique Binary Search Trees
  • Problem
  • Example
  • [1] Code (21. 10. 10)
• Reference

96. Unique Binary Search Trees

Problem

Given an integer n, return the number of structurally unique BST's (binary search trees) which has exactly n nodes of unique values from 1 to n.

Example

Input: n = 3
Output: 5

[1] Code (21. 10. 10)

Need to Retry

n/a

Wrong Reason

• 문제 유형이 DP라는 건 알았지만 점화식을 세우지 못했다.

  정답 코드를 보니 BST의 특징을 좀 더 고려하지 못했던 거 같다.

• 출처 : [Leetcode] 96. Unique Binary Search Trees

Review

• 다음엔 DP 점화식을 떠올리길 !

Reference

• 96. Unique Binary Search Trees