Example 1:
Input: root = [3,9,20,null,null,15,7]
Output: [[9],[3,15],[20],[7]]
Example 2:
Input: root = [3,9,8,4,0,1,7]
Output: [[4],[9],[3,0,1],[8],[7]]
Given the root of a binary tree, return the vertical order traversal of its nodes' values. For each node at position (row, col), its left child is at (row + 1, col - 1) and right child at (row + 1, col + 1). The root starts at column 0. Return all nodes' values grouped by column from left to right. Within each column, nodes are ordered from top to bottom. If two nodes are in the same row and column, order them from left to right.
[0, 100].-100 <= Node.val <= 100