engineering recuitment UKPSC Polytechnic Lecturer Mock Test 2024 Programming and Data Structure Tree Strict Binary Tree
Which of the following is/are correct about a strictly binary tree?
A. A binary tree is called strictly binary tree if every non-leaf node of it has non empty left and right sub tree
B. In strictly binary tree can have two children or no child
C. A strictly binary tree with n leaves always contains 2n-1 nodes
1
Only A
2
Only B
3
A and B
4
A, B and C