Consider a rooted \(n\) node binary tree represented using pointers. The best…

PYQ GATE 2014

Consider a rooted nn 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(nalog⁡bn)O(n^a\log^bn). Then the value of a+10ba + 10b is __________.

Attempted by 232 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…