Update chapTree.tex

x1957 · x1957 · commit 73434f10af33 · 2014-01-14T10:21:40.000+08:00
Unique Binary SearchTrees 时间复杂度O(n^2)
diff --git a/C++/chapTree.tex b/C++/chapTree.tex
@@ -1347,7 +1347,7 @@ \subsubsection{代码}
 
 \begin{Code}
 // LeetCode, Unique Binary Search Trees
-// 时间复杂度O(n)，空间复杂度O(n)
+// 时间复杂度O(n^2)，空间复杂度O(n)
 class Solution {
 public:
     int numTrees(int n) {
