leetcode: Unique Binary Search Trees

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

class Solution {
public:
    int numTrees(int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (n == 1)
            return 1;
            
        if (n == 2)
            return 2;
        
        int totalNum = 0;
        
        for (int i=1; i<=n; i++)
        {
            int left;
            int right;
            
            if (i == 1 || i == n)
            {
                totalNum += numTrees(n-1);
            }
            else
            {
                totalNum += numTrees(i-1)*numTrees(n-i);
            }
        }
        return totalNum;  
    }
};