I know that the number of unique bst trees with n nodes is catalan number, I am wondering how we can recursively calculate the number of unique bst trees with unique n nodes
