【LeetCode】Binary Tree Level Order Traversal II

/**
 * 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) {
            queue<TreeNode *>node,next;
	TreeNode *tmp;
	vector<vector<int>> result;
	vector<int> Inter;
	if (root)
	{
		node.push(root);
	}
	while (node.size())
	{
		while (node.size())
		{
			tmp = node.front();
	//		cout << tmp->val << " ";
			Inter.push_back(tmp->val);
			node.pop();
			if (tmp->left)
				next.push(tmp->left);
			if (tmp->right)
				next.push(tmp->right);
		}
		result.push_back(Inter);
		Inter.clear();
		swap(node, next);
	}
	reverse(result.begin(),result.end());//reverse 搞定
	return result;
    }
};