Computer Sciences > Gate 2014 Set-1 > Binary Tree
Consider a rooted 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 Lognb). Then the value of a + 10b is ________
Correct : a
Similar Questions
Consider the following New-order strategy for traversing a binary tree:
Visit the root;
Visit the right subtree using New-order
Visit the left subtree usi...
A binary tree T has 20 leaves. The number of nodes in T having two children is ________
Let T be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves a and b of T are chosen uniformly and independently at...
Total Unique Visitors
Loading......