Update chapTree.tex

Unique Binary SearchTrees 时间复杂度O(n^2)

<code>
for (int i = 2; i <= n; ++i) {
  for (int k = 1; k <= i; ++k)
      f[i] += f[k-1] * f[i - k];
}
</code>