I read merge sort trees from here (https://discuss.codechef.com/questions/94448/merge-sort-tree-tutorial) understood the build function but I can't understand the query function. Why would you go top to bottom? you'll meet the "if( x<=l && r<=y )" condition on the root node itse...