LeetCode Q314: 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]
   ]

Solution:
First, traversal entire tree to assign col index to each node. Second, BFS from top to down to save results.

	/**
	* Definition for a binary tree node.
	* struct TreeNode {
	* int val;
	* TreeNode *left;
	* TreeNode *right;
	* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
	* };
	*/
	class Solution {
	public:
	void helper(TreeNode* root, int curCol, unordered_map<TreeNode*, int>& colNums, int& minCol, int& maxCol){
	if(root==NULL)
	return;
	colNums[root]=curCol;
	minCol=min(minCol, curCol);
	maxCol=max(maxCol, curCol);
	helper(root->left, curCol-1, colNums, minCol, maxCol);
	helper(root->right, curCol+1, colNums, minCol, maxCol);
	}
	vector<vector<int>> verticalOrder(TreeNode* root) {
	if(!root){
	vector<vector<int> > tmp;
	return tmp;
	}
	unordered_map<TreeNode*, int> colNums;
	int minCol = INT_MAX;
	int maxCol = INT_MIN;
	helper(root, 0, colNums, minCol, maxCol);
	int colSize = maxCol-minCol+1;
	vector<vector<int> > res(colSize);
	queue<TreeNode*> myQ;
	myQ.push(root);
	while(!myQ.empty()){
	TreeNode* topNode=myQ.front();
	myQ.pop();
	if(topNode==NULL)
	continue;
	int colIdx=colNums[topNode]-minCol;
	res[colIdx].push_back(topNode->val);
	myQ.push(topNode->left);
	myQ.push(topNode->right);
	}
	return res;
	}
	};

view raw Q314.cpp hosted with ❤ by GitHub