Question

which one is false about strictly binary tree
1 in the nodes of strictly binary tree of depth d must be at the level d
2 A binary tree is called strictly binary tree, if every non-leaf node of it has non-empty left and right sub tree
3 A strictly binary tree with n leaves always contact 2n - 1 nodes
4 A complete binary tree of depth d is the strictly binary tree all of whose leaves are at the level d​

Answer 1

Answer:

A binary tree is called strictly binary tree, if every non-leaf node of it has non-empty left and right sub tree

Explanation:

hope it's helps you

Answer 2

Option 1 is false.

Concept :

A binary tree is a tree data structure in which each node has no more than two offspring, known as the left and right children.

Find :

The false statement about the strictly binary tree.

Solution :

A purely binary tree of depth d can have nodes at either level d or level $d-1$. Option 1 is false.

If every non-leaf node in a binary tree has a non-empty left and right subtree, it is called a strictly binary tree. A binary tree with n leaves is constantly in contact. Option 2 is true.

A binary tree with n leaves always makes touch with  $2n-1$ nodes. Option 3 is true.

The strictly binary tree with all of its leaves at level d is called a complete binary tree of depth d. Option 4 is true.