Let B(n) represent the number of binary search trees containing items 1, 2, 3, , n, then B(n) satisfies the following recurrence relation, B( 0) = 1,

Verify via explicit power series manipulations that

n B(n) = (1 1)( - i). Let 00 G(x) = (n);". =0 G(x) = x(G(x))2 + 1. n B(n) = (1 1)( - i). Let 00 G(x) = (n);". =0 G(x) = x(G(x))2 + 1