LeetCode之levelTraverse

int levelTraverse(TreeNode* tree)    //按层遍历二叉树,队列实现
	{	
		if(tree==NULL) {return 0;}
		TreeNode* p;
		p=tree;
		queue<TreeNode*> q;
		q.push(p);
		//int level=maxDepth(tree);
		while (!q.empty())
		{			
			p=q.front();			
			cout<<p->val;
			q.pop();
			if (p->left!=NULL)
				q.push(p->left);			
			if (p->right!=NULL)
				q.push(p->right);			
		}
	}