107. 二叉树的层次遍历 II

#include <iostream>
#include <algorithm>
#include "string"
#include "vector"
#include "stack"
#include "set"
#include "queue"
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) {
	vector<vector<int> > result;
	if (!root)
		return result;
	queue<TreeNode*> q;
	q.push(root);
	while (!q.empty())
	{
		vector<int> temp;
		int size = q.size();
		for (int i = 0; i<size; ++i)//for (int i = 0; i < q.size(); i++) err
		{
			TreeNode* cur = q.front();
			temp.push_back(cur->val);
			if (cur->left)
				q.push(cur->left);
			if (cur->right)
				q.push(cur->right);
			q.pop();
		}
		result.push_back(temp);
	}
	reverse(result.begin(), result.end());
	return result;
}
int main()
{
	    TreeNode t1 = TreeNode(3);
		TreeNode t2 = TreeNode(9);
		TreeNode t3 = TreeNode(20);
		TreeNode t4 = TreeNode(15);
		TreeNode t5 = TreeNode(7);
		t1.left = &t2; t1.right = &t3;
		t3.left = &t4; t3.right = &t5;
		
		levelOrderBottom(&t1);
	
	
	system("pause");
	return 0;
}