POJ1577 二叉排序树
来源:互联网 发布:vb.net excel 数据库 编辑:程序博客网 时间:2024/06/07 02:36
Falling Leaves
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5576 Accepted: 3001
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
#include <cstdio>#include <cmath>#include <cstring>using namespace std;const int maxn = 30;struct SBT{ int left,right; char c;}tree[maxn];int root,tot,st;char s[maxn][maxn];void add(int x, char ch){ if (ch<tree[x].c){ if (tree[x].left == 0){ tree[tot].c = ch; tree[x].left = tot++; } else add(tree[x].left,ch); } else { if (tree[x].right == 0){ tree[tot].c = ch; tree[x].right = tot++; } else add(tree[x].right,ch); }}void Print(int x){ printf("%c",tree[x].c); if (tree[x].left) Print(tree[x].left); if (tree[x].right) Print(tree[x].right);}int main(){ st = 0; while (scanf("%s",s[st++])!=EOF){ if (s[st-1][0]=='*' || s[st-1][0]=='$') { root = tot = 0; memset(tree,0,sizeof(tree)); tree[tot++].c = s[st-2][0]; for (int i=st-3; i>=0; i--) { for (int j=0; j<strlen(s[i]); j++) add(root,s[i][j]); } Print(root); if (s[st-1][0]=='$') break; st = 0; printf("\n"); } } return 0;}
阅读全文
0 0
- POJ1577 二叉排序树
- poj1577~Falling Leaves~二叉排序树~
- poj1577 二叉排序树基础练习题
- poj1577 Falling Leaves 二叉排序树
- poj1577
- POJ1577
- 二叉树 poj1577
- poj1577 Falling Leaves
- poj1577 Falling Leaves
- poj1577解题报告
- POJ1577 树的遍历
- 二叉排序树
- 二叉排序树
- 二叉排序树
- 二叉排序树
- 二叉排序树
- 二叉排序树
- 二叉排序树
- 鼠标悬停动画
- Linux单元小结(2)
- 算法题练习系列之(三十六): 养兔子
- Hashtable
- 【Linux】Vim修改tab为4个空格
- POJ1577 二叉排序树
- 一个简单的jdbc
- 第一篇博客--男人与男孩的区别
- THINKPHP5.0 在Liunx中配置伪静态 (URL重写)规则(解决万网虚拟空间linux系统下报错)
- 贪心算法总结
- C++一本通题库1019
- 声明
- Lucene入门教程
- JDBC(一)