leetcode-96. Unique Binary Search Trees 不同的二叉搜索樹

Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n? Example: Input: 3 Output: 5 Explanation: Given n = 3, there are a total of 5 unique BST's: 1 3
相關文章
相關標籤/搜索