What is the generating function G (z) for the sequence of Fibonacci numbers?

Solve the recurrence equations
T (n) = T (n - 1) + n
T (1) = 1

It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given.

If the no of leaves in a tree is not a power of 2,then the tree is not a binary tree.