题目大意:输入一颗二叉树,你的任务是按照从上到下,从左到右的顺序输出各个结点的值。每个结点都按照从根结点到他的移动顺序给出(L表示左,R表示右)。在输入中,每个结点的左括号和右括号之间没有空格,相邻结点之间用一个空格隔开。每棵树的输入用一对空括号()结束(这对括号本身不代表一个结点)
这是一道关于构建二叉树和层次遍历的题。阶梯思路在代码中!!!
Trees are fundamental in many branches of computer science. 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 program 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
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.
This problem involves building and traversing binary trees.
Given a sequence of binary trees, you are to write a program 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
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.
All nodes contain a positive integer. Every tree in the input will consist of at least one node and no more than 256 nodes. Input is terminated by end-of-file.
(11,LL) (7,LLL) (8,R) (5,) (4,L) (13,RL) (2,LLR) (1,RRR) (4,RR) () (3,L) (4,R) ()
5 4 8 11 13 4 7 2 1 not complete
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn=300;
struct Node
{
int have_value; //是否付过值
int v; //***结点值
Node *left,*right;
};
Node *root; //二叉树的根节点
Node* newnode()
{
Node* u=(Node*)malloc(sizeof(Node)); //申请动态内存
if(u!=NULL)
{
u->have_value=0;
u->left=u->right=NULL;
}
return u;
}
int failed;
void addnode(int v,char *s)
{
int n=strlen(s);
Node* u=root; //从根节点开始往下走
for(int i=0;i<n;i++)
{
if(s[i]=='L')
{
if(u->left==NULL)u->left=newnode(); //结点不存在,建立新结点
u=u->left; //往左走
}
if(s[i]=='R')
{
if(u->right==NULL)u->right=newnode();
u=u->right;
}
}
if(u->have_value)failed=1; //*******已经赋过值,说明输入有误
u->v=v;
u->have_value=1; //标记
}
void remove_tree(Node* u)
{
if(u==NULL)return ;
remove_tree(u->left); //释放左子树的空间
remove_tree(u->right);
free(u); //释放结点U本身的内存
}
char s[maxn]; //保存读入的结点
int read_input()
{
failed=0;
remove_tree(root);
root=newnode(); //创建根节点
for(;;)
{
if(scanf("%s",s)!=1)return 0; //***整个输入结束
if(!strcmp(s,"()")) break; //结束标志,退出循环,本次输入结束
int v;
sscanf(&s[1],"%d",&v); //读入结点值
addnode(v,strchr(s,',')+1); //查找逗号,然后插入节点
}
return 1;
}
int n,ans[maxn];
int bfs()
{
int front=0,rear=1;
n=0;
Node* q[maxn];
q[0]=root;
while(front<rear)
{
Node* u=q[front++];
if(!u->have_value)return 0; //有结点没被赋值过,表明输入有误
ans[n++]=u->v; //***把结点增加到输出序列尾部
if(u->left!=NULL)q[rear++]=u->left; //把左儿子放进队列
if(u->right!=NULL)q[rear++]=u->right;
}
return 1;
}
int main()
{
while(read_input())
{
if(!bfs())failed=1;
if(failed)printf("not complete\n");
else
{
for(int i=0;i<n-1;i++)
printf("%d ",ans[i]);
printf("%d\n",ans[n-1]);
}
}
return 0;
}