314. 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]
   ]

4. 这个题首先自己用dfs做，没有满足必须从left 到 right的条件，然后改用bfs做，用两个queue，即可。

5. /**
    * Definition for singly-linked list.
    * struct ListNode {
    *     int val;
    *     ListNode *next;
    *     ListNode(int x) : val(x), next(NULL) {}
    * };
    */
   class Solution {
   public:
       ListNode* reverseKGroup(ListNode* head, int k) {
           int size = get_size(head);
           if (k > size) {
               return head;
           }
           ListNode* dummy = new ListNode(0);
           dummy->next = head;
           ListNode* old_node = dummy;
           ListNode* node = head;
           while (head != NULL) {
               int count = 0;
               if (size < k) {
                   break;
               }
               ListNode* prev = NULL;
               while (count < k && head != NULL) {
                   ListNode* tmp = head->next;
                   head->next = prev;
                   prev = head;
                   head = tmp;
                   count++;
               }
               size = size - k;
               old_node->next = prev;
               node->next = head;
               old_node = node;
               node = head;
           }
           return dummy->next;
       }
   private:
       int get_size(ListNode* head) {
           int size = 0;
           while (head != NULL) {
               size++;
               head = head->next;
           }
           return size;
       }
   };