107. 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,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

 

return its bottom-up level order traversal as:

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

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

vector<vector<int>> levelOrderBottom(TreeNode* root) {
    if(!root)
        return {};
    queue<TreeNode*> q;
    queue<int> h;
    vector<vector<int>> ans;
    vector<int> temp;
    q.push(root);
    h.push(0);
    int preH = 0;
    while(!q.empty()){
        TreeNode* t = q.front();
        int nowH = h.front();//当前节点层次
        q.pop();
        h.pop();
        if(nowH != preH){
            ans.push_back(temp);
            temp.clear();
            preH = nowH;
        }
        temp.push_back(t->val);
        if(t->left){
            q.push(t->left);
            h.push(nowH + 1);
        }
        if(t->right){
            q.push(t->right);
            h.push(nowH + 1);
        }
    }
    ans.push_back(temp);
    temp.clear();
    reverse(ans.begin(), ans.end());
    return ans;
}