Ask a Question

prove that The maximum number of nodes possible in a binary tree of height 'h' is 2^h-1