Question #14717970

# C++ binary tree?

**Write down C++ code to create a complete binary Tree in which user can add any number of node/elements (Numeric). After Creating a complete binary tree , You need to calculate the product of the 2nd lowest level and find the smallest number in the binary tree as given in the example:
Product of Elements in 2nd last level (N-1)= 20
Smallest number in Binary Tree = 2
Note: N levels mean any number of levels.**

TELL US , if you have any answer