GATEverse Practice, past papers & mock tests
GATE 2011
Programming & Data StructuresTreesmediumMCQ1 mark
Consider it to rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having having exactly 4 nodes O(na logb n). Then the value of a + 10b is – 2015 SET 1 || MCQ || 2-mark 2015 SET 3 || MCQ || 1-mark - 2016 SET 2 || MCQ || 1-mark DATA STRUCTURE 66 Check Out Our GATE Courses & Secure Your Dream Rank! – 2014 SET 3 || MCQ || 2-mark
Save your progress

Related Programming & Data Structures PYQs