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

Which one is false about strictly binary tree 1 in the nodes of stri

1.	Which one is false about strictly binary tree 1 in the nodes of strictly binary tree of depth d must be at the level d2 A binary tree is called strictly binary tree, if every non-leaf node of it has non-empty left and right sub tree3 A strictly binary tree with n leaves always contact 2n - 1 nodes4 A complete binary tree of depth d is the strictly binary tree all of whose leaves are at the level d
Answer» A binary tree is CALLED STRICTLY binary tree, if every non-leaf node of it has non-empty left and RIGHT sub treeExplanation:HOPE it's helps you