LeetCode-Binary Tree Level Order Traversal II

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).

For example:
Given binary tree {3,9,20,#,#,15,7},

    3
   / \
  9  20
    /  \
   15   7

return its bottom-up level order traversal as:

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

OJ's Binary Tree Serialization:

The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.

Here's an example:

   1
  / \
 2   3
    /
   4
    \
     5

The above binary tree is serialized as "{1,2,3,#,#,4,#,#,5}".

Solution:

Code:

<span style="font-size:14px;">/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int> > levelOrderBottom(TreeNode *root) {
        vector<vector<int> > results;
        if (!root) return results;
        vector<queue<TreeNode *> > q(2, queue<TreeNode *>());
        int index = 0;
        q[index].push(root);
        while (!q[index].empty()) {
            vector<int> result;
            while (!q[index].empty()) {
                root = q[index].front();
                q[index].pop();
                result.push_back(root->val);
                if (root->left) q[(index+1)%2].push(root->left);
                if (root->right) q[(index+1)%2].push(root->right);
            }
            results.push_back(result);
            index = (index+1)%2;
        }
        reverse(results.begin(), results.end());
        return results;
    }
};</span>