c_cpp 广度优先遍历的.cpp

Posted 2021-05-14

//返回深度
int BreadthFirstSearch(TreeNode* pRoot, vector<int> &vecResult, int &iDepth)
{
	if(NULL == pRoot)
	{
		iDepth = 0;
		return 0;
	}
	queue<TreeNode*> queTreeNode;
	queTreeNode.push(pRoot);
	iDepth = 1;
	TreeNode* temp ;
	int iSize;
	while(!queTreeNode.empty() )
	{
		iSize = queTreeNode.size();
		for(int i = 0; i < iSize; i++)
		{
			temp = queTreeNode.front();
			vecResult.push_back( temp->val );
			if(NULL != temp->left)
			{
				queTreeNode.push( temp->left );
			}
			if(NULL != temp->right)
			{
				queTreeNode.push( temp->right );
			}
			queTreeNode.pop();
		}
		iDepth++;
	}
	return iDepth;
}


//不需要求深度
void BreadthFirstSearch(TreeNode* pRoot, vector<int> &vecResult)
{
	if(NULL == pRoot)
	{
		cout << "NULL == pRoot" << endl;
		return;
	}
	queue<TreeNode*> queTreeNode;
	queTreeNode.push(pRoot);
	TreeNode* temp;
	while(!queTreeNode.empty() )
	{
		temp = queTreeNode.front();
		vecResult.push_back( temp->val );
		if(NULL != temp->left)
		{
			queTreeNode.push( temp->left );
		}
		if(NULL != temp->right)
		{
			queTreeNode.push( temp->right );
		}
		queTreeNode.pop();
	}
}