UGC NET Computer Science July 2018 - II Question 26

Question 26

---

26. 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 :

Options:

1. (1) cannot have more than 37 nodes
2. (2) has exactly 37 nodes
3. (3) has exactly 35 nodes
4. (4) cannot have more than 35 nodes

Answer: (2) has exactly 37 nodes

Previous	Next
UGC NET CS 2018 July - II Question 25	UGC NET CS 2018 July - II Question 27