Q. 11 A program takes as input a balanced binary search tree with n leaf modes and
computes the value of a function g(x) for each node x . If the cost of computing
g(x) is 
Answer: (B)
Explanation:
Q. 11 A program takes as input a balanced binary search tree with n leaf modes and
computes the value of a function g(x) for each node x . If the cost of computing
g(x) is
Answer: (B)
Explanation:
