Suppose a binary tree is constructed with n nodes, such that each node has exactly either zero or two children. What is the maximum height of the tree?

a) (n-1)/2
b) n/2-1
c) (n-1)/2-1
d) n/2