You are given a special binary search tree where each node contains the
number of nodes in its child-trees in addition to the key.
Example.
10,5
/
/
5,3 15,0
/
/
2,0 6,1
7,0
(a,b) => a is the key
b is the number of nodes in the child trees.
Now the problem is given any two values, give an algorithm with minimum time
complexity, which gives the number of values in between the two given values
in the sorted array.
For example given 2 & 7, it should give 2 (since 5 & 6 are there in between
2 & 7). |
Starred
![\"\"](\"http://blogoscoped.com/files/google-riddle-2007-10.png\")