Update chapTree.tex

Unique Binary SearchTrees 时间复杂度O(n^2)
Mei-Zhao · Jan 14, 2014 · 73434f1 · 73434f1
1 parent c7111b2
commit 73434f1
Showing 1 changed file with 1 addition and 1 deletion.
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) {