Binary Tree Vertical Order Traversal

Given a binary tree, return the vertical order traversal of its nodes values.

For each node at position (X, Y), its left and right children respectively will be at positions (X-1, Y-1) and (X+1, Y-1).

Running a vertical line from X = -infinity to X = +infinity, whenever the vertical line touches some nodes, we report the values of the nodes in order from top to bottom (decreasing Y coordinates).

If two nodes have the same position, then the value of the node that is reported first is the value that is smaller.

Return an list of non-empty reports in order of X coordinate.  Every report will have a list of values of nodes.

Example 1:

Input: [3,9,20,null,null,15,7]
Output: [[9],[3,15],[20],[7]]
Explanation: 
Without loss of generality, we can assume the root node is at position (0, 0):
Then, the node with value 9 occurs at position (-1, -1);
The nodes with values 3 and 15 occur at positions (0, 0) and (0, -2);
The node with value 20 occurs at position (1, -1);
The node with value 7 occurs at position (2, -2).

Example 2:

Input: [1,2,3,4,5,6,7]
Output: [[4],[2],[1,5,6],[3],[7]]
Explanation: 
The node with value 5 and the node with value 6 have the same position according to the given scheme.
However, in the report "[1,5,6]", the node value of 5 comes first since 5 is smaller than 6.

思路：这题如果不care 同一个index元素的先后关系，其实可以用DFS来做，但是如果说care的话，那么就只能用level order来收集元素了，左边 index - 1， 右边index + 1，同时用iqueue和nqueue的好处是，容易track index，一一对应，省去很多麻烦如果写同一个node class的话。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<List<Integer>> verticalOrder(TreeNode root) {
        List<List<Integer>> lists = new ArrayList<List<Integer>>();
        if(root == null) {
            return lists;
        }
        HashMap<Integer, List<Integer>> hashmap = new HashMap<>();
        Queue<TreeNode> nqueue = new LinkedList<>();
        Queue<Integer> cqueue = new LinkedList<>();
        nqueue.offer(root);
        cqueue.offer(0);
        
        int minIndex = Integer.MAX_VALUE;
        int maxIndex = Integer.MIN_VALUE;
        
        while(!nqueue.isEmpty()) {
            TreeNode node = nqueue.poll();
            Integer index = cqueue.poll();
            hashmap.putIfAbsent(index, new ArrayList<Integer>());
            hashmap.get(index).add(node.val);
            
            minIndex = Math.min(minIndex, index);
            maxIndex = Math.max(maxIndex, index);
            
            if(node.left != null) {
                nqueue.offer(node.left);
                cqueue.offer(index - 1);
            }
            if(node.right != null) {
                nqueue.offer(node.right);
                cqueue.offer(index + 1);
            }
        }
        
        for(int i = minIndex; i <= maxIndex; i++) {
            lists.add(hashmap.get(i));
        }
        return lists;
    }
}