void printByLevel(Tree t)
{
Tree p;
queue<Tree> q;
q.push(t);
while (!q.empty())
{
p = q.front();
q.pop();
cout << p->val << " ";
if (p->left)
q.push(p->left);
if (p->right)
q.push(p->right);
}
}
二叉树层次遍历
最新推荐文章于 2021-03-22 11:11:17 发布