二叉树的应用与熟悉
来源:互联网 发布:消逝的光芒武器数据 编辑:程序博客网 时间:2024/05/21 11:34
一、二叉树的存储结构:
1.顺序存储结构:适用于完全二叉树
2.链式存储结构
二、建立二叉树的二叉链表
poj2255
Tree Recovery
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5290 Accepted: 3498
Description
Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes.
This is an example of one of her creations:
To record her trees for future generations, she wrote down two strings for each tree: a preorder traversal (root, left subtree, right subtree) and an inorder traversal (left subtree, root, right subtree). For the tree drawn above the preorder traversal is DBACEGF and the inorder traversal is ABCDEFG.
She thought that such a pair of strings would give enough information to reconstruct the tree later (but she never tried it).
Now, years later, looking again at the strings, she realized that reconstructing the trees was indeed possible, but only because she never had used the same letter twice in the same tree.
However, doing the reconstruction by hand, soon turned out to be tedious.
So now she asks you to write a program that does the job for her!
This is an example of one of her creations:
D
/ /
/ /
B E
/ / /
/ / /
A C G
/
/
F
To record her trees for future generations, she wrote down two strings for each tree: a preorder traversal (root, left subtree, right subtree) and an inorder traversal (left subtree, root, right subtree). For the tree drawn above the preorder traversal is DBACEGF and the inorder traversal is ABCDEFG.
She thought that such a pair of strings would give enough information to reconstruct the tree later (but she never tried it).
Now, years later, looking again at the strings, she realized that reconstructing the trees was indeed possible, but only because she never had used the same letter twice in the same tree.
However, doing the reconstruction by hand, soon turned out to be tedious.
So now she asks you to write a program that does the job for her!
Input
The input will contain one or more test cases.
Each test case consists of one line containing two strings preord and inord, representing the preorder traversal and inorder traversal of a binary tree. Both strings consist of unique capital letters. (Thus they are not longer than 26 characters.)
Input is terminated by end of file.
Each test case consists of one line containing two strings preord and inord, representing the preorder traversal and inorder traversal of a binary tree. Both strings consist of unique capital letters. (Thus they are not longer than 26 characters.)
Input is terminated by end of file.
Output
For each test case, recover Valentine's binary tree and print one line containing the tree's postorder traversal (left subtree, right subtree, root).
Sample Input
DBACEGF ABCDEFGBCAD CBAD
Sample Output
ACBFGEDCDAB
1.用到的一个函数:C++中substr函数用法
2.问题分析:
已知树的先序和中序遍历序列求树后序遍历序列
先要根据先序和中序遍历序列建立树的二叉链表,再后续遍历就可以了
3.用到的知识点:
先序遍历序列的第一个值为该树的根结点,该值在中序遍历序列中把中序遍历序列一分为二,为该值的左子树和右子树
递归建立树的二叉链表
4.代码:
- 二叉树的应用与熟悉
- 二叉树的递归建立与应用
- [HOJ]1452 Tree Recovery(对二叉树的先序、中序、后序的熟悉与掌握)
- 【笔记】树、森林与二叉树的转换与应用
- 二叉树的应用
- 二叉树的应用
- 二叉树的应用
- 二叉树的应用
- 二叉树的应用
- 二叉树的应用
- 进程的了解与熟悉
- 数据结构上机测试4.1:二叉树的遍历与应用
- 【LB】图形化编程与二叉树的应用
- 二叉树的全部遍历实现与应用
- 二叉树及二叉树的应用
- MongoDB的学习与应用二:熟悉MongoDB Shell下常用命令
- MongoDB的学习与应用二:熟悉MongoDB Shell下常用命令
- 二叉树的应用—二叉树遍历的应用
- 图形设备接口(GDI)
- 在java方法参数位置调用void方法,确定JAVA中void方法被成功调用--反射调用
- C#遍历指定文件夹中的所有文件
- 在SQL 中,附加没日志的数据库,也可以用此方法恢复数据库日志。
- SQL语法大全
- 二叉树的应用与熟悉
- PHP中调用Java的代码
- Oracle部署第一部曲;
- Linux设备驱动程序系列(一)——开篇
- android apk反编译
- 如何备份、还原Bootcamp NTFS格式的Win7
- 汇编指令
- 升级ubuntu,给整挂了
- USACO msquare (BFS+康托展开)