Gate CS-2014-1 Question Paper With Solutions

Q. 22 Consider a rooted n note binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly 4 nodes O(n^aLogn ^b). Then the value of a + 10b is ________.

(A) 1

(B) 11

(C) 12

(D) 21

Answer: (A)

Explanation: