搜索资源列表
binary
- 二叉树的基本操作，遍历，交换左右子树等功能-The basic binary operation
shiyan3
- 对四则运算表达式的抽象语法树进行后序遍历，可以得到输入表达式所对应的四元式序列（实验4要用到这样的四元式序列）。例如输入1+2*(3+4)，对应的抽象语法树的中序遍历序列、四元式序列分别为-After the abstract syntax tree arithmetic expressions were preorder, you can get input expression quaternion corresponding sequence (Experiment 4 to use th
Non-recursive-algorithm-binary
- 二叉树先序、中序、后序三种遍历的非递归算法-Non-recursive algorithm binary first order, in sequence, after three traversal
c-cpp
- (1) 实现二叉树先序遍历、中序遍历、后序遍历等运算。 (2) 实现计算二叉树叶子结点和交换二叉树中所有结点左右子树的运算 -(1) binary tree preorder, preorder, postorder traversal operations. (2) calculated to achieve binary tree leaf node and all nodes exchange binary sub-tree operations around
coo51
- 利用先序遍历创建链式存储的二叉树,suanfasheji-Use preorder create chain store binary tree, suanfasheji
recursion
- 数据结构二叉树的非递归遍历算法的实现,包括树的创建、遍历。-data structure
Btree1
- 二叉树的创建，查找遍历，插入，删除，输出-Create a binary tree, traversal search, insert, delete, output
Binary-Tree
- 关于二叉树先、中、后三种遍历的算法，以及对两棵二叉树进行判等的算法用c语言加以实现-About binary tree first, middle and last three traversal algorithms, and sentenced to two trees and other binary tree algorithm to be implemented in c language
SHUJUJIEGOU
- 本课程设中的二叉排序树，一共要实现四项基本的功能。 它们分别是二叉顺序树的创建、中序遍历、查找结点和删除结点。-This course is set up in the binary sort tree to achieve a total of four basic functions. They are the creation of a binary tree sequence, the preorder, find nodes and delete nodes.
ZWBTree
- 二叉树的建立 和二叉树的先序遍历 打印出来-Binary tree binary tree establishment and print out preorder
CATIA-V5-
- CATIA V5 遍历整个树结构的零件参数 读取 存储-CATIA V5
erchashu
- 二叉树遍历 二叉树先序、中序、后序遍历的递归算法递归算法-First binary sequence binary tree traversal, recursive algorithm in order, after the preorder of recursive algorithm
rbtree
- c语言实现了红黑树的基本初始化插入删除，采用先序遍历和中序遍历输出-c language to achieve a red-black tree insertion and deletion basic initialization using preorder and preorder output
BitTree
- 关于二叉树先序、中序、后序递归与非递归遍历的详细源代码，并附有详细的注解。适合学习数据结构二叉树的同学学习。-About Binary preorder, inorder, postorder recursive and non-recursive traversal detailed source code, together with detailed notes. Binary tree data structure for learning students learn.
最后
- 第一题：将一颗树或森林转换为二叉树 第二题：求森林高度 第三题：按层次方式遍历森林 第四题：输出一个森林中每个结点的值及对应的层次数 第五题：输出一个森林的广义表形式(First question: convert a tree or forest into two branches Second question: forest height The third question: traverse the forest in a hierarchical manner The