Data Structures

1: 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 19 nodes
	Answer : B Explanation : A strictly binary tree with 'n' leaves must have (2n � 1) nodes. Verify for some small 'n'. This can be proved by the principle of mathematical induction. Write your comments here: Updating your Comments.. Updating your Comments.. Report Error
	Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.

UGC NET Paper 1 UGC NET Computer Science UGC NET Exam GATE Exam Aptitude Viva Questions General Knowledge Computer Questions Online Test

Suggest an improvement