(二叉树) Falling Leaves (P1577)
来源:互联网 发布:linux vim 插件安装 编辑:程序博客网 时间:2024/05/16 11:02
就 是用最基本的方法把输入的数据一层一层地放入到二叉树中。
因为没有特殊情况,直接放就OK。,,然后中序遍历输出就可以了。
#include <iostream>#include <algorithm>#include <cstring>#include<cstdio>using namespace std;struct my{char num;my *left,*right;}*go,*a,*b;char s[44][44];int r;void insert(int x){a=go;int cur=x;while (true){if (x==a->num)break;if (x>a->num){if (a->right==NULL){a->right=new my ;b=a->right;b->num=x;b->left=NULL;b->right=NULL; break;}else {a=a->right;}}else {if (a->left==NULL){a->left=new my;b=a->left;b->left=NULL;b->right=NULL;b->num=x;break;}else{a=a->left;}}}}void put(my *h){cout<<h->num;if (h->left)put(h->left);if (h->right)put(h->right);}int main(){//freopen("c:\in.txt","r",stdin);int i,j,k;while (true){r=0;while (true){cin>>s[r++];if (s[r-1][0]=='*' || s[r-1][0]=='$')break;}go=new my;go->left=NULL;go->right=NULL;r--;char temp=s[r][0];r--;go->num=s[r][0];r--;while (r>=0){//cout<<s[r]<<endl;int l=strlen(s[r]);for (i=0;i<l;i++){insert(s[r][i]);}r--;}if (go)put(go);cout<<endl;if (temp=='$')break;}}
Falling Leaves
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3332 Accepted: 1851
Description
Figure 1
Figure 1 shows a graphical representation of a binary tree of letters. People familiar with binary trees can skip over the definitions of a binary tree of letters, leaves of a binary tree, and a binary search tree of letters, and go right to The problem.
A binary tree of letters may be one of two things:
- It may be empty.
- It may have a root node. A node has a letter as data and refers to a left and a right subtree. The left and right subtrees are also binary trees of letters.
In the graphical representation of a binary tree of letters:
- Empty trees are omitted completely.
- Each node is indicated by
- Its letter data,
- A line segment down to the left to the left subtree, if the left subtree is nonempty,
- A line segment down to the right to the right subtree, if the right subtree is nonempty.
- Its letter data,
A leaf in a binary tree is a node whose subtrees are both empty. In the example in Figure 1, this would be the five nodes with data B, D, H, P, and Y.
The preorder traversal of a tree of letters satisfies the defining properties:
- If the tree is empty, then the preorder traversal is empty.
- If the tree is not empty, then the preorder traversal consists of the following, in order
- The data from the root node,
- The preorder traversal of the root's left subtree,
- The preorder traversal of the root's right subtree.
- The data from the root node,
The preorder traversal of the tree in Figure 1 is KGCBDHQMPY.
A tree like the one in Figure 1 is also a binary search tree of letters. A binary search tree of letters is a binary tree of letters in which each node satisfies:
The root's data comes later in the alphabet than all the data in the nodes in the left subtree.
The root's data comes earlier in the alphabet than all the data in the nodes in the right subtree.
The problem:
Consider the following sequence of operations on a binary search tree of letters
Remove the leaves and list the data removed
Repeat this procedure until the tree is empty
Starting from the tree below on the left, we produce the sequence of trees shown, and then the empty tree
by removing the leaves with data
BDHPY
CM
GQ
K
Your problem is to start with such a sequence of lines of leaves from a binary search tree of letters and output the preorder traversal of the tree.
Input
The input will contain one or more data sets. Each data set is a sequence of one or more lines of capital letters.
The lines contain the leaves removed from a binary search tree in the stages described above. The letters on a line will be listed in increasing alphabetical order. Data sets are separated by a line containing only an asterisk ('*').
The last data set is followed by a line containing only a dollar sign ('$'). There are no blanks or empty lines in the input.
The lines contain the leaves removed from a binary search tree in the stages described above. The letters on a line will be listed in increasing alphabetical order. Data sets are separated by a line containing only an asterisk ('*').
The last data set is followed by a line containing only a dollar sign ('$'). There are no blanks or empty lines in the input.
Output
For each input data set, there is a unique binary search tree that would produce the sequence of leaves. The output is a line containing only the preorder traversal of that tree, with no blanks.
Sample Input
BDHPYCMGQK*ACB$
Sample Output
KGCBDHQMPYBAC
Source
Mid-Central USA 2000
- (二叉树) Falling Leaves (P1577)
- Uva 699 - The Falling Leaves//二叉树
- 二叉树 Poj 1577 Falling Leaves
- POJ 1577 Falling Leaves 二叉树题解
- poj-1577 Falling Leaves(搜索二叉树)
- POJ 1577 Falling Leaves 二叉树操作
- UVA699 The Falling Leaves【二叉树】【递归】
- POJ 1577 Falling Leaves 二叉树
- UVA - 699 The Falling Leaves 二叉树
- uva 699 The Falling Leaves 二叉树
- 二叉查找树 POJ Falling Leaves
- uva699 The Falling Leaves 二叉树
- poj 1577 Falling Leaves(二叉搜索树)
- UVa 699 - The Falling Leaves 二叉树的落叶
- UVa 699 The Falling Leaves (DFS遍历二叉树)
- (字母二叉树) B - Falling Leaves(10.1.2))
- POJ 1577 Falling Leaves(二叉搜索树)
- UVA 399 The Falling Leaves(二叉树)
- DLL入门浅析(3)——从DLL中导出变量
- 为什么类的静态成员变量要在类外初始化
- DLL入门浅析(4)——从DLL中导出类
- HttpURLConnection与Struts交互传参乱码问题
- C#编程中yield
- (二叉树) Falling Leaves (P1577)
- DLL入门浅析(5)——使用DLL在进程间共享数据
- PHP后退页面过期或不存在问题/点击刷新
- spydroid源码分析(三):rtp包头分析以及代码实现
- [id121212|aaaaaa]zzzzz模式匹配
- [C#] winform中的DataGridView的列宽设置(自动调整列宽)
- 中国医疗互联网行业发展现状解析
- [转]mysql的字符串函数
- 如何得到分组后,组中最大日期的纪录