A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves
| A. | cannot have more than 19 nodes |
| B. | has exactly 19 nodes |
| C. | has exactly 17 nodes |
| D. | cannot have more than 17 nodes |
Answer : B Explanation :
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
