LeetCode-Binary Tree Vertical Order Traversal

Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column).

If two nodes are in the same row and column, the order should be from left to right.

Examples:

 

1. Given binary tree [3,9,20,null,null,15,7],
   

      3
     /\
    /  \
    9  20
       /\
      /  \
     15   7
   

   return its vertical order traversal as:
   

   [
     [9],
     [3,15],
     [20],
     [7]
   ]
   

2. Given binary tree [3,9,8,4,0,1,7],
   

        3
       /\
      /  \
      9   8
     /\  /\
    /  \/  \
    4  01   7
   

   return its vertical order traversal as:
   

   [
     [4],
     [9],
     [3,0,1],
     [8],
     [7]
   ]
   

3. Given binary tree [3,9,8,4,0,1,7,null,null,null,2,5] (0's right child is 2 and 1's left child is 5),
   

        3
       /\
      /  \
      9   8
     /\  /\
    /  \/  \
    4  01   7
       /\
      /  \
      5   2
   

   return its vertical order traversal as:
   

   [
     [4],
     [9,5],
     [3,0,1],
     [8,2],
     [7]
   ]
   

 

 Analysis:

 

Note that in the second example, 2 is in the left subtree of root, but will after 8 in the results. So simple traverse may not work. We can use BFS with index recording.

 

Solution:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<List<Integer>> verticalOrder(TreeNode root) {
        List<List<Integer>> resList = new ArrayList<List<Integer>>();
        if (root==null) return resList;

        List<TreeNode> nodeList = new ArrayList<TreeNode>();
        List<Integer> indexList = new ArrayList<Integer>();
        int cur = 0, min = 0, max=0;
        nodeList.add(root);
        indexList.add(0);
    
        while (cur<nodeList.size()){
            TreeNode curNode = nodeList.get(cur);
            int curIndex = indexList.get(cur);
            if (curIndex < min) min = curIndex;
            if (curIndex > max) max = curIndex;

            if (curNode.left!=null){
                nodeList.add(curNode.left);
                indexList.add(curIndex-1);
            }
            if (curNode.right!=null){
                nodeList.add(curNode.right);
                indexList.add(curIndex+1);
            }
            cur++;
        }
        
        for (int i=min;i<=max;i++) resList.add(new LinkedList<Integer>());
        
        for (int i=0;i<nodeList.size();i++){
            resList.get(indexList.get(i)-min).add(nodeList.get(i).val);
        }

        
        return resList;
    }
        
}