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 of height 3 has nodes that either have 0 or 2 children and all leaves on the same level, how many nodes are in the tree?

7
  • 8
  • 3
  • 4
  • 5
  • 6

There are no hints for this question.