GATE Papers >> CSE >> 2014 >> Question No 249

Question No. 249 CSE | GATE 2014

Suppose we have a balanced binary search tree T holding n numbers. We are given two numbers L and H and wish to sum up all the numbers in T that lie between L and H. Suppose there are m such numbers in T. If the tightest upper bound on the time to compute the sum is 0(na logbn + mc logdn), the value of a + 10b + 100c + 1000d is ____.


Answer : 110 to 110


Comments
9EpCsb http://pills2sale.com/ levitra nizagara

Posted on  18/10/2020 14:46:26  by  dobsonz
YxrFtD http://pills2sale.com/ levitra nizagara

Posted on  18/10/2020 16:48:02  by  dobsonz
vgGoeU http://pills2sale.com/ levitra nizagara

Posted on  18/10/2020 18:00:57  by  dobsonz
Leave a comment
Go