I wrote the working code. Consider root as ith column, left tree is i-1 column and right tree as i+1 column. She told me to use treeMap to sort the column automatically. I said I would maintain the range of min and max column as it would be efficient and wont take nLogn time, everytime i insert.