《算法竞赛入门经典》6-7 Trees on the level UVA122——二叉树的层次遍历（宽度优先遍历BFS）

最新推荐文章于 2022-08-31 11:06:24 发布

原创

最新推荐文章于 2022-08-31 11:06:24 发布 · 357 阅读

2 ·

CC 4.0 BY-SA版权

本文介绍了如何解决UVA122二叉树层次遍历的问题，涉及二叉树的构造、宽度优先遍历（BFS）以及处理不完全指定的树。解题思路包括读取数据、构建二叉树结构、检查输入合法性、执行BFS和输出结果。通过结构体表示节点，利用全局变量记录输入错误，并用队列实现BFS。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Trees on the level UVA - 122

Trees are fundamental in many branches of computer science (Pun definitely intended). Current state- of-the art parallel computers such as Thinking Machines’ CM-5 are based on fat trees. Quad- and octal-trees are fundamental to many algorithms in computer graphics.

This problem involves building and traversing binary trees.

Given a sequence of binary trees, you are to write a pro- gram that prints a level-order traversal of each tree. In this problem each node of a binary tree contains a positive integer and all binary trees have have fewer than 256 nodes.

In a level-order traversal of a tree, the data in all nodes at a given level are printed in left-to-right order and all nodes at level k are printed before all nodes at level k + 1.

For example, a level order traversal of the tree on the right is: 5,4,8,11,13,4,7,2,1.

In this problem a binary tree is specified by a sequence
of pairs ‘(n,s)’ where n is the value at the node whose path
from the root is given by the string s. A path is given be
a sequence of ‘L’s and ‘R’s where ‘L’ indicates a left branch and ‘R’ indicates a right branch. In the tree diagrammed above, the node containing 13 is specified by (13,RL), and the node containing 2 is specified by (2,LLR). The root node is specified by (5,) where the empty string indicates the path from the root to itself. A binary tree is considered to be completely specified if every node on all root-to-node paths in the tree is given a value exactly once.

Input

The input is a sequence of binary trees specified as described above. Each tree in a sequence consists of several pairs ‘(n,s)’ as described above separated by