c++删除一个tree

自己写的代码，过了很久自己忘了原有的逻辑了。 = =、

while(!vec_delete_clumn.empty()) // 如果容器不为空
{
	iterTree = m_map_tree_info.find(vec_delete_clumn[0]);
	for(int32_t i = 0; i < iterTree->second->m_vec_child_id.size(); i++) // 将vec的第一个元素的子栏目ID加入vec
	{
		vec_delete_clumn.push_back(iterTree->second->m_vec_child_id[i]);
	}
	int32_t nRetCode = deleteOneColumn(vec_delete_clumn[0]); // 每次删除vec首元素
	
	if(nRetCode != MYSUCESS)
	{
		response.resp_json["code"]		=	MYERROR;
		response.resp_json["message"] 	= 	"Defeat";
		return MYERROR;
	}

	iterVecColumn = vec_delete_clumn.begin();
	vec_delete_clumn.erase(iterVecColumn);
}