give root binary tree calculate vertical order traversal binary treefor node position row col leave right child position row 1 col 1 row 1 col 1 respectively the root tree 0 0the vertical order traversal binary tree list toptobottom ordering column index start leftmost column end rightmost column there multiple node row column in case sort nod valuesreturn vertical order traversal binary tree Example 1input root 3920nullnull157output 9315207explanationcolumn 1 only node 9 columncolumn 0 node 3 15 column order bottomcolumn 1 only node 20 columncolumn 2 only node 7 columnexample 2input root 1234567output 4215637explanationcolumn 2 only node 4 columnColumn 1 only node 2 columncolumn 0 node 1 5 6 column 1 come 5 6 position 2 0 order value 5 6column 1 only node 3 columncolumn 2 only node 7 columnExample 3input root 1234657output 4215637explanationthis case exact example 2 node 5 6 swappednote solution remain 5 6 location order value ConstraintsThe number nod tree range 1 10000 Nodeval 1000