Binary Tree Level Order Traversal

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

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

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]
打开原题链接
struct TreeNode 
 {
	     int val;
	     TreeNode *left;
	    TreeNode *right;
	     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
	};

 struct node
 {
	TreeNode* treenode;
	int level;
	//node(int level) : level(level) {};
 };
	
	class Solution 
	{
	public:
		vector<vector<int> > levelOrder(TreeNode *root) 
		{
			vector<vector<int> > vvi;
			if (root == NULL)
			{
				return vvi;
			}
			deque<node>  intdeque;
			node tempnode;
			tempnode.treenode = root;
			tempnode.level =0;
			intdeque.push_back(tempnode);
			int templevel = 0;
			vector<int> vi;
			while (!intdeque.empty())
			{
				templevel = intdeque.front().level;
				while ((!intdeque.empty()) && (intdeque.front().level == templevel))
				{
					if (intdeque.front().treenode->left != NULL)
					{
						tempnode.level = intdeque.front().level + 1;
						tempnode.treenode = intdeque.front().treenode->left;
						intdeque.push_back(tempnode);
					}
					if (intdeque.front().treenode->right != NULL)
					{
						tempnode.level = intdeque.front().level + 1;
						tempnode.treenode = intdeque.front().treenode->right;
						intdeque.push_back(tempnode);
					}
					vi.push_back(intdeque.front().treenode->val);
					intdeque.pop_front();

				}
				
				vvi.push_back(vi);
				vi.clear();
			}
			return vvi;
		}
		
	};