Unique Binary Search Trees In JAVA
Given n, how many structurally unique BST‘s (binary search trees) that store values 1...n?
For example,
Given n = 3, there are a total of 5 unique BST‘s.
1 3 3 2 1 \ / / / \ 3 2 1 1 3 2 / / \ 2 1 2 3
1 public class Solution { 2 public int numTrees(int n) { 3 if(n==0||n==1) 4 return 1; 5 int res=0; 6 for(int i=1;i<=n;i++) 7 { 8 res+=numTrees(i-1)*numTrees(n-i); 9 } 10 return res; 11 } 12 }
郑重声明:本站内容如果来自互联网及其他传播媒体,其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享,并不代表本站赞同其观点和对其真实性负责,也不构成任何其他建议。