Given the root of a binary tree, return the vertical order traversal of its nodes’ values, organized column by column from top to bottom.

For any two nodes that share the same row and column, they should appear from left to right in the output.

Constraints:

• The number of nodes in the tree is in the range $[0, 100]$

• $-100 \leq$ Node.val $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.