Can anyone solve these 2 questions?

1)How many ordered trees are possible with n nodes?

2)In some books i found that, No of nodes of degree 2 in a binary tree is = no of leaves -1.But try to construct a full binary tree having say 7 nodes where no of leaves=4,so No.of deg 2 nodes should be equal to 3 acc. to the given formula but we are having only the root node having deg 2 and the other internal nodes to be of degree 3!!So no. of nodes having deg 2 should be eq to 1(root).Please explain the answers of these two questions i am getting very much confused.

Thanx in advnce...