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 ...
http://staff.city.ac.uk/~ross/papers/FingerTree.html
Summary
We present 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant tim...