Trees on the level

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 584    Accepted Submission(s): 195

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1622

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.

 
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.

 
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 1
not complete
 
Source

题意: 输入一棵二叉树,按照从上到下从左到右的顺序输出各个节点的值,每个节点都是按照从根节点到他的移动的序列给出的(L表示左,R表示右)在输入中,每个编号左括号和右括号之间没有空格,相邻的节点之间用一个空格隔开,每棵树的输入用括号()表示结束,这个括号本身不代表一个节点,注意,当根到某个叶节点的路径上的节点没有在输入中给出,或者给出超过一次,输出not complete 节点个数不超过256

题解:学习紫书上的代码,给出完整的用指针和用数组的方法的代码

一、用指针建树:

 #include<cstdio>
#include<cstring>
#include<iostream>
#include<string>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
#define maxn 260
char s[maxn];
struct Node{
bool have_value;//是否被赋值过
int v;
Node *left,*right;
Node():have_value(false),left(NULL),right(NULL){}//构造函数
};
Node *root; Node* newnode(){
return new Node();
} bool failed; void remove_tree(Node *u){//防止内存泄漏
if(u == NULL) return;
remove_tree(u->left);
remove_tree(u->right);
delete(u);
} void addnode(int v, char* s){
int n = strlen(s);
Node* u = root;
for(int i = ; i < n; i++){
if(s[i]=='L'){
if(u->left == NULL) u->left = newnode();
u = u->left;
}else if(s[i] == 'R'){
if(u->right == NULL) u->right = newnode();
u = u->right;
}
}
if(u->have_value) failed = true;//已经赋值过的认为是错误的输入
u->v = v;
u->have_value = true;//记得做标记
} bool read_input(){
failed = false;
remove_tree(root);//释放掉之前建立过得树
root = newnode();
for(;;){
if(scanf("%s",s)!=) return false;//整个输入结束
if(!strcmp(s,"()")) break;//读到结束标志
int v;
sscanf(&s[],"%d",&v);//读入节点值
addnode(v,strchr(s,',')+);//查找逗号,然后插入节点
}
return true;
} vector< int > ans; bool bfs(vector<int> & ans){
queue<Node*> q;
ans.clear(); q.push(root);
while(!q.empty()){
Node* u = q.front(); q.pop();
if(!u->have_value) return false;
ans.push_back(u->v);
if(u->left != NULL) q.push(u->left);
if(u->right != NULL) q.push(u->right);
}
return true;
} int main()
{
while(read_input()==true){
if(!failed&&bfs(ans)){
vector<int>::iterator it;
for(it = ans.begin(); it != ans.end()-; it++)
{
printf("%d ", (*it));
}
printf("%d\n",(*it));
}
else puts("not complete");
}
return ;
}

二、用数组代码:

注意,就算是用数组也要先建立路径中的节点

 #include<cstdio>
#include<cstring>
#include<iostream>
#include<string>
#include<algorithm>
#include<queue>
#include<vector>
#define N 260
const int root = ; char s[N]; int left[N];
int right[N];
bool have_value[N];
int val[N]; int cnt;
void newtree(){ left[root] = right[root] = ; have_value[root] = false; cnt = root; }
int newnode(){ int u = ++cnt; left[u] = right[u] = ; have_value[u] = false; return u; } bool failed; void addnode(int v, char* s){
int n = strlen(s);
// int u = newnode();
int tm = root;
for(int i = ; i < n; i++){
if(s[i]=='L'){
if(left[tm]==) left[tm] = newnode();
tm = left[tm];
}else if(s[i] == 'R'){
if(right[tm]==) right[tm] = newnode();
tm = right[tm];
}
}
if(have_value[tm]) failed = true;//已经赋值过的认为是错误的输入
val[tm] = v;
have_value[tm] = true;//记得做标记
} bool read_input(){
failed = false;
newtree();
for(;;){
if(scanf("%s",s)!=) return false;//整个输入结束
if(!strcmp(s,"()")) break;//读到结束标志
int v;
sscanf(&s[],"%d",&v);//读入节点值
addnode(v,strchr(s,',')+);//查找逗号,然后插入节点
}
return true;
} std::vector< int > ans; bool bfs(std::vector<int> & ans){
std::queue<int> q;
ans.clear(); q.push(root);
while(!q.empty()){
int u = q.front(); q.pop();
if(!have_value[u]) return false;
ans.push_back(val[u]);
if(left[u] != ) q.push(left[u]);
if(right[u] != ) q.push(right[u]);
}
return true;
} using namespace std;
int main()
{
while(read_input()==true){
if(!failed&&bfs(ans)){
vector<int>::iterator it;
for(it = ans.begin(); it != ans.end()-; it++)
{
printf("%d ", (*it));
}
printf("%d\n",(*it));
}
else puts("not complete");
}
return ;
}

Trees on the level(指针法和非指针法构造二叉树)的更多相关文章

  1. synchronized 修饰在 static方法和非static方法的区别

    Java中synchronized用在静态方法和非静态方法上面的区别 在Java中,synchronized是用来表示同步的,我们可以synchronized来修饰一个方法.也可以synchroniz ...

  2. Trees on the level UVA - 122 复习二叉树建立过程,bfs,queue,strchr,sscanf的使用。

    Trees are fundamental in many branches of computer science (Pun definitely intended). Current state- ...

  3. UVA 122 -- Trees on the level (二叉树 BFS)

     Trees on the level UVA - 122  解题思路: 首先要解决读数据问题,根据题意,当输入为“()”时,结束该组数据读入,当没有字符串时,整个输入结束.因此可以专门编写一个rea ...

  4. Java中synchronized 修饰在static方法和非static方法的区别

    [问题描述]关于Java中synchronized 用在实例方法和对象方法上面的区别 [问题分析]大家都知道,在Java中,synchronized 是用来表示同步的,我们可以synchronized ...

  5. E - Trees on the level

     Trees on the level  Background Trees are fundamental in many branches of computer science. Current ...

  6. VB.NET 内存指针和非托管内存的应用

    介绍 Visual Basic 从来不像在C或C++里一样灵活的操纵指针和原始内存.然而利用.NET框架中的structures 和 classes,可以做许多类似的事情.它们包括 IntPtr,   ...

  7. java——多线程——单例模式的static方法和非static方法是否是线程安全的?

    单例模式的static方法和非static方法是否是线程安全的? 答案是:单例模式的static方法和非static方法是否是线程安全的,与单例模式无关.也就说,如果static方法或者非static ...

  8. 剑指offer从上往下打印二叉树 、leetcode102. Binary Tree Level Order Traversal(即剑指把二叉树打印成多行、层序打印)、107. Binary Tree Level Order Traversal II 、103. Binary Tree Zigzag Level Order Traversal(剑指之字型打印)

    从上往下打印二叉树这个是不分行的,用一个队列就可以实现 class Solution { public: vector<int> PrintFromTopToBottom(TreeNode ...

  9. hdu 1622 Trees on the level(二叉树的层次遍历)

    题目链接:https://vjudge.net/contest/209862#problem/B 题目大意: Trees on the level Time Limit: 2000/1000 MS ( ...

随机推荐

  1. Java用代码获取classes目录下的文件的方式

    假设我们有个Maven的Web项目,其中有src/main/java和src/main/resources两个输出目录(注意这两个目录下的内容运行后都会输出到classes目录下), 而在src/ma ...

  2. 'boost/iterator/iterator_adaptor.hpp' file not found之xcode生成时报错的解决方案

    xcode生成rn(0.49.3)项目的时候出现“'boost/iterator/iterator_adaptor.hpp' file not found之xcode”报错. 原因: /Users/x ...

  3. 【算法】论平衡二叉树(AVL)的正确种植方法

    参考资料 <算法(java)>                           — — Robert Sedgewick, Kevin Wayne <数据结构>       ...

  4. ArcGIS API for JavaScript 4.2学习笔记[19] 搜索小部件——使用更多数据源

    上一篇中提到,空间搜索小部件是Search这个类的实例化,作为视图的ui属性添加进去后,视图就会出现搜索框了. 这节的主体代码和上篇几乎一致,区别就在上篇提及的sources属性. 先看看结果: 由于 ...

  5. Swift学习第一天--面向过程

    //: Playground - noun: a place where people can play import UIKit //---------------------- Hello wor ...

  6. 浅析Node.js的Event Loop

    目录 浅析Node.js的Event Loop 引出问题 Node.js的基本架构 Libuv Event Loop Event Loop Phases Overview Poll Phase The ...

  7. 操作Frame和IFrame中页面元素

    HTML <iframe> 标签 定义:iframe 元素会创建包含另外一个文档的内联框架(即行内框架). frame标签有frameset.frame.iframe三种,frameset ...

  8. Ruby学习之动态调用

    作为一个动态语言,对象中的方法不会像静态语言一样需要验证确实存在,动态语言的对象之间一直保持着交谈,如果你调用一个不曾定义过的方法,程序也不会马上就报错而无法运行,只有当运行到你调用这个方法时,解释器 ...

  9. Mac 配置Charles,抓取移动设备数据

    有两篇很详细的教程可以参考 Charles 从入门到精通 mac环境下使用Charles抓包Https请求 但是在使用iPhone抓取https数据的时候会出现很多问题,总是提示失败. 需要注意的有: ...

  10. java中的位操作

    之前做项目的时候使用位操作不是很多,今天在刷leetcode上题目的时候用到了位操作,是leetcode中的第29题Divide Two Integers. 一.java的位操作: 位运算表达式由操作 ...