hdu 1622 Trees on the level(二叉树的创建与遍历)
来源:互联网 发布:下架的网络剧 编辑:程序博客网 时间:2024/05/21 17:01
Problem Description
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.
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 whitespace. The last entry in each tree is (). No whitespace appears between left and right parentheses.
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.
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.
Output
For each completely specified binary tree in the input file, the level order traversal of that tree should be printed. If a tree is not completely specified, i.e., some node in the tree is NOT given a value or a node is given a value more than once, then the string ``not complete'' should be printed
Sample Input
(11,LL) (7,LLL) (8,R)(5,) (4,L) (13,RL) (2,LLR) (1,RRR) (4,RR) ()(3,L) (4,R) ()
Sample Output
5 4 8 11 13 4 7 2 1not complete
看图和看第一个例子就可以了。
#include <iostream>#include <string.h>using namespace std;int n,ans[1000];typedef struct Binary_Tree{ int value; struct Binary_Tree *lchild,*rchild; Binary_Tree() { value=0; lchild=rchild=NULL; }}BTree;bool Add(BTree *&root,char *s,int value) //创建二叉树{ if (root==NULL) { root=new BTree(); } if(*s=='\0') { if(root->value!=0) { return false; } root->value=value; return true; } if (*s=='L') { return Add(root->lchild, s+1, value); } else if(*s=='R') { return Add(root->rchild, s+1, value); } return false;}void Delete(BTree *&root) //删除二叉树{ if (root==NULL) { return; } Delete(root->lchild); Delete(root->rchild); delete root;}bool bfs(BTree *root) //层次遍历{ BTree *q[1000]; int front=0; int rear=1; q[0]=root; n=0; while (front<rear) { BTree *temp=q[front++]; if(!temp->value) { return false; } ans[n++]=temp->value; if(temp->lchild) { q[rear++]=temp->lchild; } if(temp->rchild) { q[rear++]=temp->rchild; } } return true;}int main(){ BTree *Root=NULL; //注意初始化 char s[1000]; bool flag; while (1) { flag=true; Delete(Root); Root=NULL; //注意需要重新置空 while (1) { if(scanf("%s",s)==EOF) { return 0; } if(strcmp(s, "()")==0) { break; } int v; sscanf(&s[1], "%d",&v); char *S=strchr(s, ','); S=++S; S[strlen(S)-1]='\0'; if(!Add(Root,S, v)) { flag=false; } } if(!flag) { printf("not complete\n"); } else { if(!bfs(Root)) { printf("not complete\n"); } else { for(int i = 0; i < n-1; i++) { printf("%d ", ans[i]); } printf("%d\n",ans[n-1]); } } }}
0 0
- hdu 1622 Trees on the level(二叉树的创建与遍历)
- UVA 122 && HDU 1622 Trees on the level(构造二叉树+BFS层序遍历)
- UVA 122 Trees on the level (二叉树层次遍历)
- UVA122 Trees on the level(二叉树建立与遍历)
- uva 122 Trees on the level 二叉树的层次遍历(bfs)
- 例题6-7 二叉树的层次遍历 UVa 122 Trees on the level
- Trees on the level(UVA122,二叉树的建立)
- Uva122 Trees on the level 二叉树的数组实现
- HDU 1622 Trees On The Level
- hdu 1622 Trees on the level
- hdu 1622 Trees on the level
- 数据结构学习之-------树 Trees on the level HDU 1622
- Trees on the level HDU
- Trees on the level HDU
- UVa 122 Trees on the level(二叉树层次遍历)
- UVa 122 Trees on the level 建立二叉树BFS层序遍历
- UVA 122 Trees on the level 二叉树层次遍历 数组&指针
- UVA 122 Trees on the level(指针二叉树,层次遍历)
- 重载前置++运算符
- Call requires API level 11 (current min is 8): new android.app.Fragment API版本冲突解决办法
- IOS 添加收藏的动画效果
- 小米 真机调试 无法连接mac解决
- iOS项目目录结构和开发流程
- hdu 1622 Trees on the level(二叉树的创建与遍历)
- JS—数组整理
- IOS消息推送之APNS
- Jenkins知识地图
- mysql(ddl)(data defininition language)
- Linux下,JDK环境搭建
- DBA必备的15款MySQL管理工具
- Android中的硬件加速
- FTP连接时出现“227 Entering Passive Mode” 的解决方法