GATE Computer Science (CS) 2014 Shift 1 Solved Paper

Question : 22 of 65

Marks: +1, -0

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