Given that the height of a tree is 1 more than the number of edges from the root to the deepest node, if a binary tree has n nodes that either have 0 or 2 children and all leaves on the same level, what is the height of the tree?

• \log_{2} (n-1)
• \log_{2} (n)
• 2^n
• 2^{(n+1)}
• 2^{(n-1)}