文件名称:test05_333
介绍说明--下载内容均来自于网络,请自行研究使用
1、 输入一个完全二叉树的层次遍历字符串,创建这个二叉树,输出这个二叉树的前序遍历字符串、中序遍历字符串、后序遍历字符串、结点数目、二叉树高度(上述每一个结果独立一行显示)。
2、 输入二叉树前序序列和中序序列(各元素各不相同),创建这个二叉树,输出该二叉树的后序序列、层次遍历。(, the input string level traversal of a completely two fork tree, creating the two binary tree, preorder traversal string, the output of the two binary tree traversal, postorder traversal string string, the number of nodes, two tree height (each row shows the results of independent).
2. Input the two forked tree preorder sequence and the middle sequence sequence (each element is different), create this two forked tree, output the rear sequence of the two tree and traverse the hierarchy.)
2、 输入二叉树前序序列和中序序列(各元素各不相同),创建这个二叉树,输出该二叉树的后序序列、层次遍历。(, the input string level traversal of a completely two fork tree, creating the two binary tree, preorder traversal string, the output of the two binary tree traversal, postorder traversal string string, the number of nodes, two tree height (each row shows the results of independent).
2. Input the two forked tree preorder sequence and the middle sequence sequence (each element is different), create this two forked tree, output the rear sequence of the two tree and traverse the hierarchy.)
相关搜索: C++
(系统自动生成,下载前可以参看下载内容)
下载文件列表
文件名 | 大小 | 更新时间 |
---|---|---|
test05_林浩然201600301303.docx | 23304 | 2017-12-05 |
test05_林浩然201600301303.exe | 1920529 | 2017-11-29 |
test05_林浩然201600301303.cpp | 7042 | 2017-11-29 |