For what size list would the resulting tree be a complete tree of height 10?
If I am interpreting your questions correctly...
You are asking how big must your list be in order to have a complete graph of height 10 and if I am remember correctly then I believe:
To be a complete graph it would have to contain a max of: $\displaystyle 2^h-1$
and a minimum of: $\displaystyle 2^h-2^{h-1}$
where h = height
so in this case it would have to have a minimum of 512 and a maximum of 1023