搜索资源列表
BTree
- 本程序采用扩展先序遍历序列的办法建立二叉树，并能实现二叉树的前，中，后和层遍历以及求深度的简单操作。-This procedure used to expand first traversal sequence to set up binary tree and binary tree to realize the before, during and after and the depth of layer traversal, as well as for simple operation.
bitree
- 二叉树的前序遍历改变为中序遍历输出，C++库封装实现-Pre-order traversal of the tree to change the traversal of the output, C++ library package to achieve
rebuild
- 树重建问题。 给出树的后序、中序遍历顺序，求出数的前序遍历顺序。-Tree reconstruction. After the tree given sequence, the order of traversal, the number of pre-calculated sequence traversal.
erchashu
- 实现二叉树的基本功能，包括前序遍历，中序遍历，后序遍历，层次遍历-To achieve the basic functions of a binary tree, including the pre-order traversal, inorder traversal, postorder, level traversal
BiTreeAll
- 使用二叉链表实现二叉树的基本功能： 1、二叉树的建立 2、前序遍历二叉树 3、中序遍历二叉树 4、后序遍历二叉树 5、按层序遍历二叉树 6、求二叉树的深度 7、求指定结点到根的路径 8、二叉树的销毁 -Use two forks linked to achieve the basic functions of a binary tree: 1, the establishment of two binary tree, preorder traversal b
BT
- 二叉树的前序遍历以及中序遍历以及后序遍历-BinaryTree
homework
- 设二叉树的结点的数据场之值仅为一大写英文字母。其前序和中序的遍历结果（打印结点的数据场之值）分别保存在字符串数组 preorder[N] 及 inorder[N]之中，其中 N 为常数。请设计程序以标准形式存储保存该二叉树。-Based binary tree node data field of the value is only a capital letter. The pre-order traversal order and the results (the data field t
yy
- 实现二叉树中所有节点左右子树的交换,有前序遍历、中序遍历、后序遍历以及层序遍历-About all the nodes in a binary tree subtree exchange, there are pre-order traversal, preorder, and postorder traversal sequence
ConstructBinaryTree
- 输入某二叉树前序遍历和中序遍历的结果，重建出该二叉树-And enter the result preorder traversal of a binary tree before, reconstruct the binary tree
binarytree
- 二叉树以lson-rson链接方式存储，以菜单方式设计并完成功能任务：建立并存储树、输出前序遍历结果、输出中序遍历结果、输出后序遍历结果、交换左右子树、统计高度，其中对于中序、后序的遍历运算要求采用非递归方式。-Binary links to lson-rson stored to design the menu and complete functional tasks: Create and store the tree, the output results before preorder
BinaryTree
- 二叉树类的全部实现：建树、清空、判空、找根节点、找父节点、找子节点、剪枝、前序遍历、中序遍历、后序遍历和层次遍历、判断是否为完全二叉树。-All binary tree class: achievements, empty, empty sentence, find the root node, find the parent node, find the child nodes, pruning, preorder, preorder, postorder traversal and leve
NO6
- 剑指offer，输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并输出它的后序遍历序列。-An offer, enter the preamble of a binary tree traversal and sequence traversal results in reconstruction of the bin
erchashu
- 二叉树的建立，前序遍历。中序遍历，后序遍历，数据结构课程设计。-Establishment of a binary tree, preorder traversal. Preorder, postorder traversal, data structures course design.
Test4_19B
- 二叉树的前序遍历，中序遍历，后序遍历，实现了迭代其的使用-Pre-order binary tree traversal, preorder, after preorder realized iteration of its use
erchashu
- 进行一些二叉树的基本操作：1) 前序遍历：将二叉树按前序遍历输出； 2) 中序遍历：将二叉树按前序遍历输出； 3) 后序遍历：将二叉树按前序遍历输出； 4) 层序遍历：将二叉树按前序遍历输出； 5) 求高度：求出二叉树的高度； 6) 求最大宽度：求出二叉树的最大宽度； 7) 判断是否满二叉树： 判断所输入的二叉树是否满二叉树； -Some binary basic steps: 1) pre-order traversal: preorder output binar
binary-tree
- 数据结构课程设计 已知二叉树的前序遍历序列和中序遍历序列，确定唯一的一棵二叉树。-Data structure course design The preamble of known binary tree traversal sequence and the sequence traversal sequence, to determine the only a binary tree.
BinaryTree
- 二叉树前序中序后序遍历遍历代码，使用c++编写(Two fork tree preorder, in order, after traversal traversal code, using c++ write)
二叉树遍历
- 简单的二叉树遍历，中序遍历，后序遍历，前序遍历(Simple two tree traversal)
970214
- 根据前序序列和中序序列生成二叉树并进行遍历,()
BinaryTreeRestore
- 重建二叉树.依据某二叉树的前序遍历和中序遍历结果，重建该二叉树。(binary tree restore. According to the forward-sequence and middle-sequence result of the binary tree to restore the binary tree.)