Question

A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves :

Answer 1

Answer:

I don't know what is the answer

Answer 2

Answer:

The answer is  It has exactly 37 nodes.

Explanation:

The tree is termed as strictly binary tree because every non-leaf node in a binary tree has nonempty left and right subtrees.

A strictly binary tree with N leaves always contains 2N-1 nodes.

Here we have 19 leaves.

N = 19 leaves

Therefore,

2N - 1  =  (2×19) - 1

           =  38 - 1

          =  37 nodes

Therefore, It has exactly 37 nodes.

∦SPJ3